Planar k-Path in Subexponential Time and Polynomial Space
Publication:3104782
DOI10.1007/978-3-642-25870-1_24zbMATH Open1341.05044OpenAlexW118014313MaRDI QIDQ3104782FDOQ3104782
Saket Saurabh, Matthias Mnich, Daniel Lokshtanov
Publication date: 16 December 2011
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_24
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Paths and cycles (05C38)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of a Planar Separator Theorem
- On problems without polynomial kernels
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Highly connected sets and the excluded grid theorem
- A Separator Theorem for Planar Graphs
- (Meta) Kernelization
- Bidimensionality and Geometric Graphs
- Treewidth. Computations and approximations
- Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Subexponential parameterized algorithms
- Faster Steiner Tree Computation in Polynomial-Space
- Saving space by algebraization
- Parameterized and Exact Computation
- Algorithms – ESA 2005
- Subexponential algorithms for partial cover problems
- Graph separators: A parameterized view
Cited In (4)
This page was built for publication: Planar k-Path in Subexponential Time and Polynomial Space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104782)
