Digital Library
Close Browse articles from a journal
 
<< previous    next >>
     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
           All articles of the corresponding issues
                                       Details for article 3 of 22 found articles
 
 
  A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs
 
 
Title: A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs
Author: Mokeev, D. B.
Malyshev, D. S.
Appeared in: Optimization letters
Paging: Volume 14 () nr. 6 pages 1317-1322
Year: 2019-09-03
Contents:
Publisher: Springer Berlin Heidelberg, Berlin/Heidelberg
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

                             Details for article 3 of 22 found articles
 
<< previous    next >>
 
 Koninklijke Bibliotheek - National Library of the Netherlands