Enumerating minimal subset feedback vertex sets

DOI10.1007/978-3-642-22300-6_34MaRDI QIDQ5199260zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger

Publication date 12 August 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22300-6_34

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Enumerating minimal subset feedback vertex sets
• An exact algorithm for subset feedback vertex set on chordal graphs
• Subset feedback vertex sets in chordal graphs
• On the minimum feedback vertex set problem: Exact and enumeration algorithms

Cited in

(21)

• Approximating minimum feedback vertex sets in hypergraphs
• An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
• Minimal dominating sets in graph classes: combinatorial bounds and enumeration
• A Fixed-Parameter Enumeration Algorithm for the Weighted FVS 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
• On the minimum feedback vertex set problem: Exact and enumeration algorithms
• scientific article; zbMATH DE number 5492392 (Why is no real title available?)
• Exact algorithms via multivariate subroutines
• Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
• Subset feedback vertex set on graphs of bounded independent set size
• Subset feedback vertex set on graphs of bounded independent set size
• Subset feedback vertex sets in chordal graphs
• On enumerating all minimal solutions of feedback problems
• Enumerating vertices of the balanced minimum evolution polytope
• Efficient constant-factor approximate enumeration of minimal subsets for monotone properties with weight constraints
• Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
• Algorithms and Computation
• Faster exact algorithms for some terminal set problems
• Enumerating minimum feedback vertex sets in directed graphs with union-cat trees

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)