Exact algorithm for the maximum induced planar subgraph problem

Authors:
Fedor V. Fomin;Ioan Todinca;Yngve Villanger
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway;LIFO, Université d'Orléans, Orléans cedes, France;Department of Informatics, University of Bergen, Bergen, Norway
Venue:
ESA'11 Proceedings of the 19th European conference on Algorithms
Year:
2011

Citing 9
Cited 2

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Treewidth and Minimum Fill-in: Grouping the Minimal Separators

SIAM Journal on Computing
New upper bounds on the decomposability of planar graphs

Journal of Graph Theory
Exact Algorithms for Treewidth and Minimum Fill-In

SIAM Journal on Computing
On Independent Sets and Bicliques in Graphs

Graph-Theoretic Concepts in Computer Science
Exact Exponential Algorithms

Exact Exponential Algorithms
Fast exponential algorithms for maximum γ-regular induced subgraph problems

FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Exact computation of maximum induced forest

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Partitioning based algorithms for some colouring problems

CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming

Solving the 2-disjoint connected subgraphs problem faster than 2n

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Finding a maximum induced degenerate subgraph faster than 2n

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.00

Visualization

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 2nnO(1) bound of the brute-force search algorithm for the MAXIMUM INDUCED PLANAR SUBGRAPH problem.