Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
From MaRDI portal
Publication:2169982
Cites work
- A characterisation of rigid circuit graphs
- A randomized polynomial kernel for subset feedback vertex set
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- Clustering and domination in perfect graphs
- Computing subset transversals in \(H\)-free graphs
- Computing weighted subset transversals in \(H\)-free graphs
- Dominating Sets in Chordal Graphs
- Efficient graph representations
- Enumerating minimal subset feedback vertex sets
- Finding disjoint paths in split graphs
- Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem
- Graph theory
- Hamiltonian circuits in interval graph generalizations
- scientific article; zbMATH DE number 1496855 (Why is no real title available?)
- Intersection graphs of non-crossing paths
- Intersection graphs of paths in a tree
- Mim-width. II. The feedback vertex set problem
- Mim-width. III. Graph powers and generalized distance domination problems
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Node-Deletion Problems on Bipartite Graphs
- On the tractability of optimization problems on \(H\)-graphs
- Parameterized algorithms
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs
- Reducibility among combinatorial problems
- Subset feedback vertex set on graphs of bounded independent set size
- Subset feedback vertex sets in chordal graphs
- The complexity of generalized clique covering
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- The leafage of a chordal graph
- The longest path problem has a polynomial solution on interval graphs
- The separator theorem for rooted directed vertex graphs
- The vertex leafage of chordal graphs
Cited in
(6)- Subset feedback vertex sets in chordal graphs
- Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs
- Parameterized complexity of multicut in weighted trees
- A parameterized algorithm for subset feedback vertex set in tournaments
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Domination and cut problems on chordal graphs with bounded leafage
This page was built for publication: Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2169982)
