Pages that link to "Item:Q2447531"
From MaRDI portal
The following pages link to Subset feedback vertex sets in chordal graphs (Q2447531):
Displayed 17 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- (Q5009483) (← links)
- Linear-Time Generation of Random Chordal Graphs (Q5283388) (← links)
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs (Q5915760) (← links)
- Computing subset transversals in \(H\)-free graphs (Q5918462) (← links)
- Subset feedback vertex set in chordal and split graphs (Q5919404) (← links)
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width (Q5970812) (← links)
- A parameterized algorithm for subset feedback vertex set in tournaments (Q6076355) (← links)
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs (Q6111961) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs (Q6140360) (← links)