Pages that link to "Item:Q4899243"
From MaRDI portal
The following pages link to An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs (Q4899243):
Displaying 5 items.
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation (Q2025063) (← links)
- Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms (Q2272595) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)