Node multiway cut and subset feedback vertex set on graphs of bounded mim-width

DOI10.1007/978-3-030-60440-0_31OpenAlexW3097733747MaRDI QIDQ5918600

Charis Papadopoulos, Bergougnoux Benjamin, Jan Arne Telle

Publication date: 21 December 2022

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-60440-0_31

zbMATH Keywords

rank-widthmim-widthsubset feedback vertex setnode multiway cutd-neighbor equivalence

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

Solving problems on generalized convex graphs via mim-width ⋮ Computing weighted subset transversals in \(H\)-free graphs ⋮ Bounding the mim‐width of hereditary graph classes ⋮ List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective ⋮ Solving problems on generalized convex graphs via mim-width ⋮ Bounding the Mim-Width of Hereditary Graph Classes. ⋮ Computing subset transversals in \(H\)-free graphs ⋮ More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints

This page was built for publication: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width