Planar k-Path in Subexponential Time and Polynomial Space

DOI10.1007/978-3-642-25870-1_24zbMath1341.05044MaRDI QIDQ3104782

Saket Saurabh, Daniel Lokshtanov, Matthias Mnich

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

zbMATH Keywords

\(H\)-minor-free graphs

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

05C12: Distance in graphs

05C85: Graph algorithms (graph-theoretic aspects)