Fast sub-exponential algorithms and compactness in planar graphs

DOI10.1007/978-3-642-23719-5_31MaRDI QIDQ3092244zbMATH OpenOpenAlexFDO

Authors Dimitrios M. Thilikos

Publication date 16 September 2011

Published in Algorithms – ESA 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23719-5_31

zbMATH Keywords

planar graphsparameterized algorithmsbranchwidth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• Coverability and sub-exponential parameterized algorithms in planar graphs
• Subexponential Parameterized Algorithms
• Subexponential parameterized algorithms
• Subexponential-time parameterized algorithm for Steiner tree on planar graphs
• scientific article; zbMATH DE number 1756013

Cited in

(10)

• Coverability and sub-exponential parameterized algorithms in planar graphs
• scientific article; zbMATH DE number 4049079 (Why is no real title available?)
• Subexponential-time parameterized algorithm for Steiner tree on planar graphs
• Subexponential parameterized algorithms for graphs of polynomial growth
• Confronting intractability via parameters
• Contractions of Planar Graphs in Polynomial Time
• Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs
• scientific article; zbMATH DE number 871895 (Why is no real title available?)
• Approximation algorithms for NP-complete problems on planar graphs
• Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs

This page was built for publication: Fast sub-exponential algorithms and compactness in planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092244)