scientific article; zbMATH DE number 1979504

MaRDI QIDQ4425960zbMATH OpenFDO

Authors Ulrike Stege, Iris van Rooij, Alex Hertel, Philipp Hertel

Publication date 14 September 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2518/25180249.htm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Programming involving graphs or networks (90C35) Mathematical psychology (91E99)

Recommendations

• An improved fixed-parameter algorithm for vertex cover
• On efficient fixed-parameter algorithms for weighted vertex cover
• Improved upper bounds for vertex cover
• scientific article; zbMATH DE number 2080245
• Improved Upper Bounds for Partial Vertex Cover

Cited in

(5)

• Sources of complexity in subset choice
• The Impact of Parameterized Complexity to Interdisciplinary Problem Solving
• On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
• Solving partial dominating set and related problems using twin-width

This page was built for publication:

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