Pages that link to "Item:Q472481"
From MaRDI portal
The following pages link to Enumerating minimal subset feedback vertex sets (Q472481):
Displaying 31 items.
- Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
- Minimal dominating sets in interval graphs and trees (Q344851) (← links)
- Computing weighted subset transversals in \(H\)-free graphs (Q832863) (← links)
- On the minimum feedback vertex set problem: Exact and enumeration algorithms (Q958216) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
- Enumeration and maximum number of minimal connected vertex covers in graphs (Q1678095) (← links)
- Enumerating vertices of the balanced minimum evolution polytope (Q2003580) (← links)
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs (Q2136850) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009) (← links)
- Solving target set selection with bounded thresholds faster than \(2^n\) (Q2684482) (← links)
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs (Q2914318) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
- (Q5009483) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- Enumerating Minimal Subset Feedback Vertex Sets (Q5199260) (← links)
- (Q5503334) (← links)
- Algorithms and Computation (Q5897846) (← 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)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← 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)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- Classifying subset feedback vertex set for \(H\)-free graphs (Q6549683) (← links)
