Computing weighted subset transversals in H-free graphs

DOI10.1007/978-3-030-83508-8_17MaRDI QIDQ832863zbMATH OpenOpenAlexFDO

Authors Nick Brettell, Matthew Johnson, Daniël Paulusma

Publication date 25 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-83508-8_17

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3445275 (Why is no real title available?)
• Computing subset transversals in \(H\)-free graphs
• Connected vertex cover for \((sP_1+P_5)\)-free graphs
• Enumerating minimal subset feedback vertex sets
• Independent domination versus weighted independent domination
• Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
• Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
• On cycle transversals and their connected variants in the absence of a small linear forest
• On line graphs of subcubic triangle-free graphs
• Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs
• Subset feedback vertex set on graphs of bounded independent set size

Cited in

(6)

• Computing Weighted Subset Transversals in $H$-Free Graphs
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
• Computing subset transversals in \(H\)-free graphs
• Computing Weighted Subset Odd Cycle transversals in \(H\)-free graphs
• Computing subset transversals in \(H\)-free graphs
• Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage

This page was built for publication: Computing weighted subset transversals in \(H\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832863)