Largest Chordal and Interval Subgraphs Faster Than 2 n

DOI10.1007/978-3-642-40450-4_17zbMath1394.68164OpenAlexW2179374656WikidataQ60488423 ScholiaQ60488423MaRDI QIDQ2849310

Michał Pilipczuk, Fedor V. Fomin, Yngve Villanger, Ivan A. Bliznets

Publication date: 17 September 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40450-4_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

Largest chordal and interval subgraphs faster than \(2^n\) ⋮ Solving target set selection with bounded thresholds faster than \(2^n\) ⋮ Solving Target Set Selection with Bounded Thresholds Faster than 2^n ⋮ Vertex Deletion Problems on Chordal Graphs

This page was built for publication: Largest Chordal and Interval Subgraphs Faster Than 2 n