Complexity of the maximum \(k\)-path vertex cover problem
From MaRDI portal
Publication:1641128
DOI10.1007/978-3-319-75172-6_21zbMath1498.68211OpenAlexW2789025184MaRDI QIDQ1641128
Toshiki Saitoh, Tsuyoshi Yagita, Tom C. van der Zanden, Eiji Miyano, Ryuhei Uehara
Publication date: 15 June 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-75172-6_21
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
This page was built for publication: Complexity of the maximum \(k\)-path vertex cover problem