Large induced subgraphs via triangulations and CMSO

DOI10.1137/1.9781611973402.44zbMath1423.05170OpenAlexW2951133359MaRDI QIDQ5384004

Fedor V. Fomin, Ioan Todinca, Yngve Villanger

Publication date: 20 June 2019

Published in: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973402.44

Mathematics Subject Classification ID

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

Related Items (1)

Induced disjoint paths in circular-arc graphs in linear time

This page was built for publication: Large induced subgraphs via triangulations and CMSO