Abstract
Graph separation is a well-known tool to make (hard) graph problems accessible for a divide and conquer approach. We show how to use graph separator theorems in order to develop fixed parameter algorithms for many well-known NP-hard (planar) graph problems. We coin the key notion of glueable select&verify graph problems and derive from that a prospective way to easily check whether a planar graph problem will allow for a fixed parameter divide and conquer algorithm of running time c√k · nO(1) for a constant c.
Cite
CITATION STYLE
Alber, J., Fernau, H., & Niedermeier, R. (2001). Graph separators: A parameterized view. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2108, pp. 318–327). Springer Verlag. https://doi.org/10.1007/3-540-44679-6_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
