Searching among Intervals and Compact Routing Tables

Algorithmica (New York)

Volumn 15, Issue 5, 1996, Pages 448-466

  Frederickson, G N ^a  

^a Purdue University   (United States)

Author keywords

All pairs shortest paths; Analysis of algorithms; Compact routing table; Graph decomposition; Outerplanar graph; Predecessor finding; Succinct encoding

Indexed keywords

EID: 1542605579     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01955044     Document Type: Article

References (25)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Massachusetts, 1974.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. McGraw-Hill, New York, 1990.
3. N. Deo and C. Pang. Shortest-path algorithms: taxonomy and annotation. Networks, 14:275-323, 1984.
4. E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1:269-271, 1959.
5. H. N. Djidjev, G. E. Pantziou, and C. D. Zaraliagis. Computing shortest paths and distances in planar graphs. Proceedings of the International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 510, pp. 327-338. Springer-Verlag, Berlin, 1991.
6. R. W. Floyd. Algorithm 97: shortest path. Comm. ACM, 5:345, 1962.
7. G. N. Frederickson. Implicit data structures for the dictionary problem. J. Assoc. Comput. Mach., 30:80-94, 1983.
8. G. N. Frederickson. Implicit data structures for weighted elements. Inform. and Control, 66:61-82, 1985.
9. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput., 16:1004-1022, 1987.
10. G. N. Frederickson. Planar graph decomposition and all pairs shortest paths. J. Assoc. Comput. Mach., 38:162-204, 1991.
11. G. N. Frederickson. Searching among intervals and compact routing tables. Proceedings of the International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 709, pp. 28-39. Springer-Verlag, Berlin, 1993.
12. G. N. Frederickson. Using cellular embeddings in solving all pairs shortest paths problems. J. Algorithms, 19:45-85, 1995.
13. G. N. Frederickson and R. Janardan. Designing networks with compact routing tables. Algorithmica, 3:171-190, 1988.
14. M. L. Fredman. New bounds on the complexity of the shortest path problem. SIAM J. Comput., 5:83-89, 1976.
15. M. L. Fredman, J. Komlos, and E. Szemeredi. Storing a sparse table with O (1) worst case access. J. Assoc. Comput. Mach., 31:538-544, 1984.
16. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. J. Assoc. Comput. Mach., 34:596-615, 1987.
17. F. Harary. Graph Theory. Addison-Wesley, Reading, Massachusetts, 1969.
18. J. I. Munro and H. Suwanda. Implicit data structures for fast search and update. J. Comput. System Sci., 21:236-250, 1980.
19. N. Santoro and R. Khatib. Labelling and implicit routing in networks. Comput. J., 28:5-8, 1985.
20. R. E. Tarjan and A. C.-C. Yao. Storing a sparse table. Comm. ACM, 21:606-611, 1979.
21. P. Van Emde Boas, R. Kaas, and E. Zijlstra. Design and implementation of an efficient priority queue. Math. Systems Theory, 10:99-127, 1977.
22. J. van Leeuwen and R. B. Tan. Computer networks with compact routing tables. In G. Rozenberg and A. Salomaa, editors. The Book of L, pp. 259-273. Springer-Verlag, New York, 1986.
23. S. Warshall. A theorem on boolean matrices. J. Assoc. Comput. Mach., 9:11-12, 1962.
24. D. E. Willard. Log-logarithmic worst-case range queries are possible in space Θ(n). Inform. Process. Lett., 17:81-84, 1983.
25. A. C.-C. Yao. Should tables be sorted? J. Assoc. Comput. Mach., 28:615-628, 1981.