Kernelization and Complexity Results for Connectivity Augmentation Problems

DOI10.1007/978-3-540-73951-7_42zbMath1209.68370OpenAlexW1635253802MaRDI QIDQ3603551

Jiong Guo, Johannes Uhlmann

Publication date: 17 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_42

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Related Items (3)

Two edge modification problems without polynomial kernels ⋮ Two fixed-parameter algorithms for vertex covering by paths on trees ⋮ Two Edge Modification Problems without Polynomial Kernels

This page was built for publication: Kernelization and Complexity Results for Connectivity Augmentation Problems