Large Induced Subgraphs via Triangulations and CMSO

DOI10.1137/140964801zbMath1357.05144arXiv1309.1559WikidataQ60488392 ScholiaQ60488392MaRDI QIDQ2954371

Fedor V. Fomin, Yngve Villanger, Ioan Todinca

Publication date: 13 January 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.1559

zbMATH Keywords

treewidth; graph algorithms; minimal triangulations; potential maximal cliques; CMSO

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

05C85: Graph algorithms (graph-theoretic aspects)

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