Pages that link to "Item:Q5199260"
From MaRDI portal
The following pages link to Enumerating Minimal Subset Feedback Vertex Sets (Q5199260):
Displaying 14 items.
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Enumerating minimal subset feedback vertex sets (Q472481) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- Enumerating vertices of the balanced minimum evolution polytope (Q2003580) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- Faster Exact Algorithms for Some Terminal Set Problems (Q2867080) (← links)
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (Q2914318) (← links)
- (Q5503334) (← links)
- Algorithms and Computation (Q5897846) (← links)