Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
Quickly excluding a planar graph
Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Discrete Applied Mathematics - Special issue: Combinatorial Optimization 1992 (CO92)
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Decision algorithms for unsplittable flow and the half-disjoint paths problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Highly connected sets and the excluded grid theorem
Journal of Combinatorial Theory Series B
One or two disjoint circuits cover independent edges. Lovász-Woodal conjecture
Journal of Combinatorial Theory Series B
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Cycles through a prescribed vertex set in N-connected graphs
Journal of Combinatorial Theory Series B
Finding paths and cycles of superpolylogarithmic length
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Graphs and Hypergraphs
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
Journal of the ACM (JACM)
A nearly linear time algorithm for the half integral parity disjoint paths packing problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the forty-second ACM symposium on Theory of computing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Subexponential algorithms for partial cover problems
Information Processing Letters
Shortest cycle through specified elements
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |
We consider the following problem: Given k independent edges in G. Is there a polynomial time algorithm to decide whether or not G has a cycle through all of these edges ? If the answer is yes, detect such a cycle in polynomial time. This problem can be viewed as an algorithmic aspect of the conjecture of Lovász [22] and Woodall [34]. For fixed k, it follows from the seminal result of Robertson and Seymour [29] that there is a polynomial time algorithm to decide this problem. But, the proof of its correctness requires the full power of machinery from the graph minor series of papers, which consist of more than 20 papers and 500 pages. In addition, the hidden constant is an extremely rapidly growing function of k. Even k = 3, the algorithm is not practical at all. Our main result is to give a better algorithm for the problem in the following sense. 1. Even when k is a non-trivially super-constant number (up to O((log log n)1/10)), there is a polynomial time algorithm for the above problem (So the hidden constant is not too large). 2. The time complexity is O(n2), which improves Robertson and Seymour's algorithm whose time complexity is O(n3). Our algorithm has several appealing features. Although our approach makes use of several ideas underlying the Robertson and Seymour's algorithm, our new algorithmic components allow us to give a self-contained proof within 10 pages, which is much shorter and simpler than Robertson and Seymour's. In addition, if an input is a planar graph or a bounded genus graph, we can get a better bound for the hidden constant. More precisely, for the planar case, when k is a non-trivially super-constant number up to k ≤ O((log n/(log log n))1/4), there is a polynomial time algorithm, and for the bounded genus case, when k is a nontrivially super-constant number up to k ≤ O((log (n/g)/(log log (n/g)))1/4), there is a polynomial time algorithm, where g is the Euler genus.