SCOPUS 정보 검색 플랫폼

Volumn 31, Issue 3, 2002, Pages 706-721

The compactness of interval routing for almost all graphs

Author keywords

Compact routing; Interval routing; Random graphs

Indexed keywords

GRAPH THEORY; POLYNOMIALS; PROBABILITY; ROUTERS;

ROUTING TABLES;

ALGORITHMS;

EID: 0036302073 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S0097539799351717 Document Type: Article

Times cited : (9)

References (10)

1
- 0003430191
- John Wiley and Sons, New York
- (1992) The Probabilistic Method
- Alon, N.¹ Spencer, J.H.²

3
- 0032631072
- Space-efficient routing tables for almost all networks and the incompressibility method
- (1999) SIAM J. Comput. , vol.28 , pp. 1414-1432
- Buhrman, H.¹ Hoepman, J.-H.² Vitányi, P.³

4
- 0033298462
- Kolmogorov random graphs and the incompressibility method
- (1999) SIAM J. Comput. , vol.29 , pp. 590-599
- Buhrman, H.¹ Li, M.² Tromp, J.³ Vitányi, P.⁴

5
- 84947920559
- The complexity of interval routing on random graphs
- Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Sciences, J. Wiederman and P. Hájek, eds., Springer-Verlag, Berlin
- (1995) Lecture Notes in Comput. Sci. , vol.969 , pp. 37-49
- Flammini, M.¹ Van Leeuwen, J.² Marchetti-Spaccamela, A.³

6
- 0000783882
- A survey on interval routing
- (2000) Theoret. Comput. Sci. , vol.245 , pp. 217-253
- Gavoille, C.¹

7
- 0001538805
- The compactness of interval routing
- (1999) SIAM J. Discrete Math. , vol.12 , pp. 459-473
- Gavoille, C.¹ Peleg, D.²

9
- 0022013653
- Labelling and implicit routing in networks
- (1985) Comput. J. , vol.28 , pp. 5-8
- Santoro, N.¹ Khatib, R.²

10
- 0023400167
- Interval routing
- (1987) Comput. J. , vol.30 , pp. 298-307
- Van Leeuwen, J.¹ Tan, R.B.²

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.