Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
From MaRDI portal
Publication:2136850
DOI10.1016/j.jcss.2022.03.002OpenAlexW4226106908MaRDI QIDQ2136850
Daniël Paulusma, Nick Brettell, Matthew Johnson
Publication date: 16 May 2022
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2022.03.002
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enumerating minimal subset feedback vertex sets
- Computing weighted subset transversals in \(H\)-free graphs
- Paw-free graphs
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- Independent feedback vertex set for \(P_5\)-free graphs
- Linear time solvable optimization problems on graphs of bounded clique-width
- 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
- Parameterized Algorithms for Even Cycle Transversal
- Independent Set in P5-Free Graphs in Polynomial Time
- 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
- Connected vertex cover for \((sP_1+P_5)\)-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
- Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs
- Finding large induced sparse subgraphs in c >t -free graphs in quasipolynomial time
- Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs
This page was built for publication: Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
