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 58 of 244 found articles
 
 
  Computing a minimum-dilation spanning tree is NP-hard
 
 
Title: Computing a minimum-dilation spanning tree is NP-hard
Author: Cheong, Otfried
Haverkort, Herman
Lee, Mira
Appeared in: Computational geometry
Paging: Volume 41 (2008) nr. 3 pages 18 p.
Year: 2008
Contents:
Publisher: Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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