Largest Chordal and Interval Subgraphs Faster Than 2 n

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

Fedor V. Fomin, Michał Pilipczuk, 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

68Q25: Analysis of algorithms and problem complexity

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)