Subset feedback vertex sets in chordal graphs
DOI10.1016/J.JDA.2013.09.005zbMATH Open1298.05302OpenAlexW2110960146MaRDI QIDQ2447531FDOQ2447531
Authors: Pinar Heggernes, Dieter Kratsch, Reza Saei, Petr A. Golovach 
Publication date: 28 April 2014
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2013.09.005
Recommendations
- An exact algorithm for subset feedback vertex set on chordal graphs
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
- Subset feedback vertex set on graphs of bounded independent set size
- Subset feedback vertex set on graphs of bounded independent set size
- Chord-set subgraphs of chordal graphs
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Feedback vertex sets and cyclically reducible graphs
chordal graphsubset feedback vertex setexact exponential-time algorithmmaximum number of minimal subset feedback vertex sets
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact exponential algorithms.
- Efficient graph representations
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- On cliques in graphs
- On rigid circuit graphs
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Combinatorial bounds via measure and conquer
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- The complexity of generalized clique covering
- Finding induced subgraphs via minimal triangulations
- Enumeration of minimal dominating sets and variants
- An exact algorithm for subset feedback vertex set on chordal graphs
- Enumerating minimal subset feedback vertex sets
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- On enumerating all minimal solutions of feedback problems
- Feedback vertex sets in tournaments
- Feedback vertex set on AT-free graphs
Cited In (19)
- A parameterized algorithm for subset feedback vertex set in tournaments
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Exact algorithms for restricted subset feedback vertex set in chordal and split graphs
- Enumerating minimal connected dominating sets in graphs of bounded chordality
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Enumerating minimal subset feedback vertex sets
- An exact algorithm for subset feedback vertex set on chordal graphs
- Exact and parameterized algorithms for restricted subset feedback vertex set in chordal graphs
- Enumeration and maximum number of minimal connected vertex covers in graphs
- Subset feedback vertex set on graphs of bounded independent set size
- Subset feedback vertex set on graphs of bounded independent set size
- Enumerating Minimal Tropical Connected Sets
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- Computing subset transversals in \(H\)-free graphs
- Minimal dominating sets in interval graphs and trees
- Linear-time generation of random chordal graphs
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Faster exact algorithms for some terminal set problems
- Enumerating minimal subset feedback vertex sets
Uses Software
This page was built for publication: Subset feedback vertex sets in chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447531)
