Enumerating minimal subset feedback vertex sets
From MaRDI portal
Enumerating minimal subset feedback vertex sets (scientific article; zbMATH DE number 5938290)
Recommendations
Cited in
(21)- On enumerating all minimal solutions of feedback problems
- Approximating minimum feedback vertex sets in hypergraphs
- Enumerating vertices of the balanced minimum evolution polytope
- Subset feedback vertex set on graphs of bounded independent set size
- Subset feedback vertex sets in chordal graphs
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- Faster exact algorithms for some terminal set problems
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- Enumerating minimal subset feedback vertex sets
- On the number of minimal dominating sets on some graph classes
- An exact algorithm for subset feedback vertex set on chordal graphs
- Subset feedback vertex set on graphs of bounded independent set size
- Exact algorithms via multivariate subroutines
- scientific article; zbMATH DE number 5492392 (Why is no real title available?)
- Algorithms and Computation
- Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
- Enumerating minimum feedback vertex sets in directed graphs with union-cat trees
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
This page was built for publication: Enumerating minimal subset feedback vertex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199260)