686 search results - page 18 / 138 » Packing Cycles in Graphs |
DM
2008
14 years 9 months ago
2008
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...
DAGSTUHL
2007
14 years 11 months ago
2007
One of the standard basic steps in drawing hierarchical graphs is to invert some arcs of the given graph to make the graph acyclic. We discuss exact and parameterized algorithms fo...
ICALP
2000
Springer
15 years 1 months ago
2000
Springer
We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
CLUSTER
2003
IEEE
15 years 2 months ago
2003
IEEE
This paper presents an analysis of utilizing unused cycles on supercomputers through the use of many small jobs. What we call “interstitial computing,” is important to superco...