SCOPUS 정보 검색 플랫폼

Volumn 3, Issue 1-4, 1988, Pages 171-190

Designing networks with compact routing tables

Author keywords

Distributed network; Graph theory; Message routing; Outerplanar network; Routing table; Shortest paths

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - GRAPH THEORY;

COMPACT ROUTING TABLES; MESSAGE ROUTING; OPTIMAL ALGORITHM; OUTERPLANAR NETWORK; SHORTEST PATHS;

COMPUTER SYSTEMS, DIGITAL;

EID: 3743052727 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/BF01762113 Document Type: Article

Times cited : (109)

References (14)

2
- 84936718326
- G. Chartrand and F. Harary, Planar permutation graphs, Annales de l'Institut Henri Poincaré, Section B3, 1967, pp. 433–438.

3
- 0018490910
- Approximation algorithms for some postman problems
- (1979) Journal of the Association for Computing Machinery , vol.26 , Issue.3 , pp. 538-554
- Frederickson, G.N.¹

4
- 0020542090
- Implicit data structures for the dictionary problem
- (1983) Journal of the Association for Computing Machinery , vol.30 , Issue.1 , pp. 80-94
- Frederickson, G.N.¹

5
- 84936718329
- G. N. Frederickson and R. Janardan, Optimal message routing without complete routing tables, Proceedings of the 5th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, Calgary, August 1986, pp. 88–97.

6
- 84936718328
- G. N. Frederickson and R. Janardan, Separator-based strategies for efficient message routing, Proceedings of the 27th Annual IEEE Symposium on Foundations of Computer Science, Toronto, October 1986, pp. 428–437.

7
- 84936718334
- G. N. Frederickson and R. Janardan, Efficient fault-tolerant routings in outerplanar networks, manuscript, 1987.

9
- 0018457301
- A separator theorem for planar graphs
- (1979) SIAM Journal on Applied Mathematics , vol.36 , Issue.2 , pp. 177-189
- Lipton, R.J.¹ Tarjan, R.E.²

10
- 0019075996
- Implicit data structures for fast search and update
- (1980) Journal of Computer and System Sciences , vol.21 , Issue.2 , pp. 236-250
- Munro, J.I.¹ Suwanda, H.²

11
- 0022013653
- Labelling and implicit routing in networks
- (1985) The Computer Journal , vol.28 , Issue.1 , pp. 5-8
- Santoro, N.¹ Khatib, R.²

12
- 0002804540
- Computer networks with compact routing tables
- G., Rozenberg, A., Salomaa, Springer-Verlag, New York
- (1986) The Book of L , pp. 259-273
- van Leeuwen, J.¹ Tan, R.B.²

13
- 84936718285
- J. van Leeuwen and R. B. Tan, Interval routing, Technical Report RUU-CS-85-16, Department of Computer Science, University of Utrecht, The Netherlands.

14
- 84945708259
- A theorem on boolean matrices
- (1962) Journal of the ACM , vol.9 , Issue.1 , pp. 11-12
- Warshall, S.¹

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