An exact algorithm for subset feedback vertex set on chordal graphs
From MaRDI portal
Publication:4899243
DOI10.1007/978-3-642-33293-7_10zbMATH Open1374.05216OpenAlexW205540785MaRDI QIDQ4899243FDOQ4899243
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30)
Cited In (8)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- Enumerating minimal subset feedback vertex sets
- Subset feedback vertex set in chordal and split graphs
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms
- 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)