A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs
Crossref DOI link: https://doi.org/10.1007/s11590-019-01475-0
Published Online: 2019-09-03
Published Print: 2020-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Mokeev, D. B.
Malyshev, D. S.
Text and Data Mining valid from 2019-09-03
Version of Record valid from 2019-09-03
Article History
Received: 20 June 2019
Accepted: 29 August 2019
First Online: 3 September 2019