An exact algorithm for subset feedback vertex set on chordal graphs

DOI10.1007/978-3-642-33293-7_10MaRDI QIDQ4899243zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Subset feedback vertex sets in chordal graphs
• Enumerating minimal subset feedback vertex sets
• Enumerating minimal subset feedback vertex sets

Cited in

(6)

• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• Enumerating minimal subset feedback vertex sets
• Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
• The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
• Subset feedback vertex sets in chordal graphs
• Enumerating minimal subset feedback vertex sets

This page was built for publication: An exact algorithm for subset feedback vertex set on chordal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899243)