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 18 of 26 found articles
 
 
  Matching Algorithms Are Fast in Sparse Random Graphs
 
 
Title: Matching Algorithms Are Fast in Sparse Random Graphs
Author: Bast, Holger
Mehlhorn, Kurt
Schafer, Guido
Tamaki, Hisao
Appeared in: Theory of computing systems
Paging: Volume 39 (2005) nr. 1 pages 3-14
Year: 2005
Contents:
Publisher: Springer-Verlag, New York
Source file: Elektronische Wetenschappelijke Tijdschriften
 
 

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