Near-optimum universal graphs for graphs with bounded degrees
Noga Alon Michael Capalbo; Yoshiko Wakabayashi; Vojtech Rodl; Andrzej Rucinski; Endre Szemerédi; International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001 (4. 2001 Berkeley); International Workshop on Randomization and Approximation Techniques in Computer Science - RANDOM 2001 (5. 2001 Berkeley)
Proceedings Berlin: Springer, 2001
Berlin Springer 2001
Localização:
IME - Inst. Matemática e Estatística
(PROD-1241370 ) e outros locais(Acessar)
Hitting time of hamilton cycles in random bipartite graphs
Béla Bollobás Yoshiharu Kohayakawa; International Conference in Graph Theory, Combinatorics, Algorithms and Applications (2. : 1989 : San Francisco, Califórnia, US)
Proceedings Philadelphia : Siam, 1991
Philadelphia SIAM 1991
Localização:
IME - Inst. Matemática e Estatística
(QA845.C I61g 2. ) e outros locais(Acessar)