Skip to main content
Conference Proceedings

Exact algorithm for the maximum induced planar subgraph problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6942 LNCS 287-298
DOI: 10.1007/978-3-642-23719-5_25
13Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove that in an n-vertex graph, an induced planar subgraph of maximum size can be found in time O(1.7347n ). This is the first algorithm breaking the trivial 2 n nO(1) bound of the brute-force search algorithm for the Maximum Induced Planar Subgraph problem. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Fomin, F. V., Todinca, I., & Villanger, Y. (2011). Exact algorithm for the maximum induced planar subgraph problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6942 LNCS, pp. 287–298). https://doi.org/10.1007/978-3-642-23719-5_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free