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 16 of 20 found articles
 
 
  Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
 
 
Title: Np-hardness proof and an approximation algorithm for the minimum vertex ranking spanning tree problem
Author: Miyata, Keizo
Masuyama, Shigeru
Nakayama, Shin-ichi
Zhao, Liang
Appeared in: Discrete applied mathematics
Paging: Volume 154 (2006) nr. 16 pages 9 p.
Year: 2006
Contents:
Publisher: Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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