An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs

DOI10.1007/978-3-642-33293-7_10zbMath1374.05216OpenAlexW205540785MaRDI QIDQ4899243

Pinar Heggernes, Dieter Kratsch, Reza Saei, Petr A. Golovach

Publication date: 7 January 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-33293-7_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Minimal dominating sets in graph classes: combinatorial bounds and enumeration ⋮ Subset feedback vertex sets in chordal graphs ⋮ The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation

This page was built for publication: An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs