Parameterized and Exact Computation

DOI10.1007/b100584zbMath1104.68546OpenAlexW2475962691MaRDI QIDQ5311507

Elena Prieto, Christian Sloper

Publication date: 23 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100584

zbMATH Keywords

crown reductionfixed parameter algorithms

Mathematics Subject Classification ID

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

Related Items (7)

On the kernelization of split graph problems ⋮ A parameterized perspective on packing paths of length two ⋮ Confronting intractability via parameters ⋮ Kernelization of Two Path Searching Problems on Split Graphs ⋮ Crown reductions for the minimum weighted vertex cover problem ⋮ Improved upper bounds for vertex cover ⋮ A Parameterized Perspective on Packing Paths of Length Two

This page was built for publication: Parameterized and Exact Computation