1188 search results - page 115 / 238 » Extended Graph Unification |
DM
2007
14 years 10 months ago
2007
We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We al...
EOR
2007
14 years 10 months ago
2007
Abstract. In this paper, we present a simple polynomial-time algorithm solving the shortest multipaths problem in particular grid graphs called dense channels. Our work extends the...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We describe soft versions of the global cardinality constraint and the regular constraint, with efficient filtering algorithms maintaining domain consistency. For both constraints,...
116
click to vote
FOCS
2006
IEEE
15 years 4 months ago
2006
IEEE
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...