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)