Parameterized complexity: Exponential speed-up for planar graph problems

DOI10.1007/3-540-48224-5_22MaRDI QIDQ4535799zbMATH OpenFDO

Authors Jochen Alber, Henning Fernau, Rolf Niedermeier

Publication date 16 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48224-5_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parameterized complexity: exponential speed-up for planar graph problems
• STACS 2004
• Mathematical Foundations of Computer Science 2004
• Graph separators: A parameterized view
• Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up

Cited in

(19)

• Computing small partial coverings
• On parameterized exponential time complexity
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
• On the existence of subexponential parameterized algorithms
• Graph separators: A parameterized view
• Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
• Parameterized complexity: the main ideas and connections to practical computing
• Fast sub-exponential algorithms and compactness in planar graphs
• On Parameterized Exponential Time Complexity
• Intractability in graph drawing and geometry: FPT approaches
• scientific article; zbMATH DE number 125608 (Why is no real title available?)
• scientific article; zbMATH DE number 1979505 (Why is no real title available?)
• scientific article; zbMATH DE number 2038758 (Why is no real title available?)
• Graph separators: A parameterized view
• Parameterized complexity: exponential speed-up for planar graph problems
• STACS 2004
• Tree-decompositions of small pathwidth
• Theory and application of width bounded geometric separators
• New plain-exponential time classes for graph homomorphism

This page was built for publication: Parameterized complexity: Exponential speed-up for planar graph problems

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