Exact Algorithm for the Maximum Induced Planar Subgraph Problem
From MaRDI portal
Publication:3092237
DOI10.1007/978-3-642-23719-5_25zbMath1346.05283OpenAlexW8067098WikidataQ60488560 ScholiaQ60488560MaRDI QIDQ3092237
Fedor V. Fomin, Ioan Todinca, Yngve Villanger
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_25
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Largest chordal and interval subgraphs faster than \(2^n\) ⋮ Large Induced Subgraphs via Triangulations and CMSO ⋮ Solving target set selection with bounded thresholds faster than \(2^n\) ⋮ Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) ⋮ Solving Target Set Selection with Bounded Thresholds Faster than 2^n ⋮ Scheduling partially ordered jobs faster than \(2^n\) ⋮ Subexponential-time algorithms for finding large induced sparse subgraphs ⋮ Compositional properties of alignments
This page was built for publication: Exact Algorithm for the Maximum Induced Planar Subgraph Problem
