Exact Algorithm for the Maximum Induced Planar Subgraph Problem

Abstract : We prove that in an n-vertex graph, an induced planar subgraph of maximum size can be found in time O(1.7347^n ). This is the first algorithm breaking the trivial 2^n n^{O(1)} bound of the brute-force search algorithm for the Maximum Induced Planar Subgraph problem.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00660650
Contributor : Ioan Todinca <>
Submitted on : Tuesday, January 17, 2012 - 11:45:43 AM
Last modification on : Thursday, January 17, 2019 - 3:06:04 PM

Links full text

Identifiers

Collections

Citation

Fedor Fomin, Ioan Todinca, Yngve Villanger. Exact Algorithm for the Maximum Induced Planar Subgraph Problem. European Symposium on Algorithms, 2011, Germany. pp.287-298, ⟨10.1007/978-3-642-23719-5_25⟩. ⟨hal-00660650⟩

Share

Metrics

Record views

93