Enumerating minimal subset feedback vertex sets
From MaRDI portal
Recommendations
Cites work
- A 4k^2 kernel for feedback vertex set
- A measure \& conquer approach for the analysis of exact algorithms
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- Efficient graph representations
- Enumerating minimal subset feedback vertex sets
- Exact Computation of Maximum Induced Forest
- Exact exponential algorithms.
- Faster fixed parameter tractable algorithms for finding feedback vertex sets
- Finding induced subgraphs via minimal triangulations
- Improved algorithms for feedback vertex set problems
- Multiway cuts in node weighted graphs
- On enumerating all minimal solutions of feedback problems
- On feedback vertex set new measure and new structures
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Reducibility among combinatorial problems
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The complexity of generalized clique covering
Cited in
(41)- On enumerating all minimal solutions of feedback problems
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Enumerating vertices of the balanced minimum evolution polytope
- Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Enumeration of minimal connected dominating sets for chordal graphs
- Subset feedback vertex set on graphs of bounded independent set size
- Faster exact algorithms for some terminal set problems
- Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Enumerating Minimal Tropical Connected Sets
- Minimal dominating sets in interval graphs and trees
- Polynomial delay algorithm for listing minimal edge dominating sets in graphs
- A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
- scientific article; zbMATH DE number 2163938 (Why is no real title available?)
- An exact algorithm for subset feedback vertex set on chordal graphs
- Subset feedback vertex set on graphs of bounded independent set size
- Solving target set selection with bounded thresholds faster than \(2^n\)
- Exact algorithms via multivariate subroutines
- Enumerating minimal subset feedback vertex sets
- scientific article; zbMATH DE number 5492392 (Why is no real title available?)
- Algorithms and Computation
- Computing subset transversals in \(H\)-free graphs
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Classifying subset feedback vertex set for H-free graphs
- Parameterized complexity of multicut in weighted trees
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Classifying subset feedback vertex set for \(H\)-free graphs
- Domination and cut problems on chordal graphs with bounded leafage
- Computing subset vertex covers in H-free graphs
- Breaking the barrier 2ᵏ for subset feedback vertex set in chordal graphs
- Solving directed multiway cut faster than 2ⁿ
- Solving subset feedback vertex set in chordal graphs faster than 2ᵏ
- Subset feedback vertex set and subset vertex cover on AT-free graphs
- Computing weighted subset transversals in \(H\)-free graphs
- 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 Q472481)
