Fast Sub-exponential Algorithms and Compactness in Planar Graphs

DOI10.1007/978-3-642-23719-5_31zbMATH Open1346.68117OpenAlexW2125185305MaRDI QIDQ3092244FDOQ3092244

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)

Cited In (7)

• Title not available (Why is that?)
• Subexponential parameterized algorithms for graphs of polynomial growth
• Confronting intractability via parameters
• Contractions of Planar Graphs in Polynomial Time
• Title not available (Why is that?)
• 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)