Computing weighted subset transversals in \(H\)-free graphs (Q832863): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-83508-8_17 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3197901415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing subset transversals in \(H\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle transversals and their connected variants in the absence of a small linear forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerating minimal subset feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithm for Maximum Weight Independent Set on <i>P</i><sub>6</sub>-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected vertex cover for \((sP_1+P_5)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination versus weighted independent domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: On line graphs of subcubic triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset feedback vertex set on graphs of bounded independent set size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:05, 28 July 2024

scientific article
Language Label Description Also known as
English
Computing weighted subset transversals in \(H\)-free graphs
scientific article

    Statements

    Identifiers