Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Complexity of the maximum \(k\)-path vertex cover problem

From MaRDI portal
Publication:1641128
Jump to:navigation, search

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



Mathematics Subject Classification ID

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1641128&oldid=13955494"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki