Partial characterizations of networks supporting shortest path interval labeling schemes

Networks

Volumn 32, Issue 2, 1998, Pages 103-113

  Narayanan, Lata ^a   Shende, Sunil ^b  

^a Gina Cody School of Engineering and Computer Science   (Canada)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

Graph theory; Interval routing algorithms; Theory of parallel and distributed computation

Indexed keywords

EID: 0039395989     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199809)32:2<103::AID-NET3>3.0.CO;2-F     Document Type: Article

References (16)

1. B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg, Improved routing strategies with succinct tables. J. Alg. 11 (1990) 307-341.
2. E. Bakker, J. van Leeuwen, and R. Tan, Linear interval routing. Alg. Rev. 2 (1991) 45-61.
3. H. Bodlaender, J. van Leeuwen, R. Tan, and D. Thilikos, On interval routing schemes and treewidth. Workshop on Graph Algorithms (1995).
4. B. Bollobas, Graph Theory: An Introductory Course. Springer-Verlag (1979).
5. P. Fragniaud and C. Gavoille, A characterization of networks supporting linear interval routing. Principles of Distributed Computing (1994) 216-224.
6. P. Fraigniaud and C. Gavoille, Optimal interval routing. Parallel Processing, CONPAR 94-VAPP VI. Springer-Verlag Lecture Notes in Computer Science. Springer-Verlag (1994).
7. G. Frederickson and R. Janardan, Designing networks with compact routing tables. Algorithmica 3 (1988) 171-190.
8. G. Frederickson and R. Janardan, Efficient message routing in planar networks. SIAM J. Comput. 18(4) (1989) 843-857.
9. G. Frederickson and R. Janardan, Space-efficient message routing in c-decomposable networks. SIAM J. Comput. 19(1) (1990) 164-181.
10. C. Gavoille and E. Guevrernont, Worst-case bounds for shortest path interval routing. Research Report #95-02, Ecole Normale Superieure of Lyon (1995).
11. M. Golumbic, Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980).
12. INMOS, The T9000 Transputer Overview Manual (1991).
13. E. Kranakis, D. Krizanc, and S. Ravi, On multi-label linear interval routing schemes. Workshop on Graph-Theoretic Concepts in Computer Science, (WG), Springer Verlag Lecture Notes in Computer Science, Vol. 790. Springer-Verlag (1993) 338-349.
14. P. Ruzicka, On the efficiency of interval routing algorithms. Proceedings of MFCS, Springer-Verlag Lecture Notes in Computer Science, Vol. 324. Springer-Verlag (1988) 492-500.
15. N. Santoro and R. Khatib, Labeling and implicit routing in networks. Comput. J. 28(1) (1985) 5-8.
16. J. van Leeuwen and R. Tan, Interval routing. Comput. J. 30(4) (1987) 298-307.