Computing weighted subset transversals in \(H\)-free graphs
From MaRDI portal
Publication:832863
DOI10.1007/978-3-030-83508-8_17OpenAlexW3197901415MaRDI QIDQ832863
Nick Brettell, Daniël Paulusma, Matthew Johnson
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_17
Related Items (4)
Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs ⋮ Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage ⋮ Computing subset transversals in \(H\)-free graphs
Cites Work
- Unnamed Item
- Enumerating minimal subset feedback vertex sets
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Independent domination versus weighted independent domination
- Subset feedback vertex set on graphs of bounded independent set size
- On line graphs of subcubic triangle-free graphs
- Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
- Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
- On cycle transversals and their connected variants in the absence of a small linear forest
- Computing subset transversals in \(H\)-free graphs
- Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
- Connected vertex cover for \((sP_1+P_5)\)-free graphs
This page was built for publication: Computing weighted subset transversals in \(H\)-free graphs
