Computing weighted subset transversals in \(H\)-free graphs
type: Item
instance of: scholarly article
title: Computing weighted subset transversals in \(H\)-free graphs
DOI: 10.1007/978-3-030-83508-8_17
author: Nick Brettell
author: Matthew Johnson
author: Daniël Paulusma
publication date: 2022-03-25T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7498680
MaRDI profile type: Publication
full work available at URL: 978-3-030-83508-8 17
OpenAlex ID: W3197901415
cites work: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width
cites work: Computing subset transversals in \(H\)-free graphs
cites work: Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
cites work: On cycle transversals and their connected variants in the absence of a small linear forest
cites work: Enumerating minimal subset feedback vertex sets
cites work: Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs
cites work: Connected vertex cover for \((sP_1+P_5)\)-free graphs
cites work: Independent domination versus weighted independent domination
cites work: On line graphs of subcubic triangle-free graphs
cites work: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
cites work: Subset feedback vertex set on graphs of bounded independent set size
cites work: Q4770411
description: scientific article; zbMATH DE number 7498680