A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs
Work
Year: 2019
Type: article
Source: Optimization Letters
Authors Д. Б. Мокеев, D. S. Malyshev
Institutions N. I. Lobachevsky State University of Nizhny Novgorod, National Research University Higher School of Economics
Cites: 13
Cited by: 3
Related to: 10
FWCI: 0.494
Citation percentile (by year/subfield): 35.63
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: closed