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 2 of 13 found articles
 
 
  Approximating the minimum clique cover and other hard problems in subtree filament graphs
 
 
Title: Approximating the minimum clique cover and other hard problems in subtree filament graphs
Author: Keil, J. Mark
Stewart, Lorna
Appeared in: Discrete applied mathematics
Paging: Volume 154 (2006) nr. 14 pages 13 p.
Year: 2006
Contents:
Publisher: Elsevier B.V.
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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