Interval routing on k-trees

Journal of Algorithms

Volumn 26, Issue 2, 1998, Pages 325-369

  Narayanan, Lata ^a   Nishimura, Naomi ^b  

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

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038585412     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1997.0880     Document Type: Article

References (13)

1. B. Awerbuch, A. Bar-now, N. Linial, and D. Peleg, Improved routing strategies with succinct tables, J. Algorithms 11 (1990), 307-341.
2. E. Bakker, J. van Leeuwen, and R. Tan, Linear interval routing, Algorithms Rev. 2 (1991), 45-61.
3. H. Bodlaender, J. van Leeuwen, R. Tan, and D. Thilikos, On interval routing schemes and treewidth, in "Workshop on Graph-Theoretic Concepts in Computer Science (WG)," Lecture Notesin Computer Science, Vol. 1017, pp. 181-186, Springer-Verlag, New York, 1995.
4. P. Fraigniaud and C. Gavoille, Optimal interval routing, in "Parallel Processing, CONPAR 94-VAPP VI," Lecture Notes in Computer Science, Vol. 854, pp. 785-796, Springer-Verlag, New York, 1994.
5. G. Frederickson and R. Janardan, Designing networks with compact routing tables, Algorithmic 3 (1988), 171-190.
6. G. Frederickson and R. Janardan, Efficient message routing in planar networks, SIAM J. Comput. 18 (1989), 843-857.
7. G. Frederickson and R. Janardan, Space-efficient message routing in c-decomposable networks, SIAM J. Comput. 19 (1990), 164-181.
8. T. Kloks, "Treewidth - Computations and Approximations," Lecture Notes in Computer Science, Vol. 842, Springer-Verlag, New York, 1994.
9. E. Kranakis, D. Krizanc, and S. Ravi, On multi-label linear interval routing schemes, in "Workshop on Graph-Theoretic Concepts in Computer Science (WG)," Lecture Notes in Computer Science, Vol. 790, pp. 338-349, Springer-Verlag, New York, 1993.
10. L. Narayanan and S. Shende, Characterizations of networks supporting shortest path interval routing schemes, in "Proceedings of the Third International Colloquium on Structural Information and Communication Complexity," pp. 73-87, June 1996.
11. D. J. Rose and R. E. Tarjan, Algorithmic aspects of vertex elimination, in "Proceedings of the 7th Annual ACM Symposium on Theory of Computing," pp. 317-322, 1975.
12. N. Santoro and R. Khatib, Labelling and implicit routing in networks, Comput. J. 28 (1985), 5-8.
13. J. van Leeuwen and R. Tan, Interval routing, Comput. J. 30 (1987), 298-307.