An exact algorithm for subset feedback vertex set on chordal graphs
From MaRDI portal
Publication:4899243
Recommendations
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)