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, 2001Berlin Springer 2001
Localização: IME - Inst. Matemática e Estatística (PROD-1241370 ) e outros locais(Acessar)
- 0
- 1
- 2
- 3
- 4
- 5
- 6
- 7
- 8
- 9
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
prod-1245106
prod-1236214
browse_callnumber
display.do?gathStatTab=true&dscnt=0&callNumberBrowseField=browse_callnumber&tabRealType=browseshelf&mode=Basic&vid=USP&rfnGrp=1&tab=usp_producao&dstmp=1721418871015&rfnGrpCounter=1&fctV=Wakabayashi%2C+Y&callNumber=prod-1241370&fctN=facet_creator&vl(freeText0)=Computer%20Science&ct=display&fn=search&indx=2&recIdxs=0&elementId=0