In the PLANAR +k VERTEX problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of graphs, hence by the deep results of Robertson and Seymour [19,18], there is an O(n3) time algorithm for every fixed value of k. However, the proof is extremely complicated and the constants hidden by the big-O notation are huge. Here we give a much simpler algorithm for this problem with quadratic running time, by iteratively reducing the input graph and then applying techniques for graphs of bounded treewidth. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Marx, D., & Schlotter, I. (2007). Obtaining a planar graph by vertex deletion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4769 LNCS, pp. 292–303). Springer Verlag. https://doi.org/10.1007/978-3-540-74839-7_28
Mendeley helps you to discover research relevant for your work.