1729 search results - page 42 / 346 » On Bounds for the k-Partitioning of Graphs |
ICPR
2004
IEEE
15 years 11 months ago
2004
IEEE
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
EOR
2008
14 years 10 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
PAAPP
2000
14 years 9 months ago
2000
Minimizing the amount of time and number of processors needed to perform an application reduces the application's fabrication cost and operation costs. A directed acyclic gra...
MFCS
1995
Springer
15 years 1 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...