Streaming algorithm for graph spanners-single pass and constant processing time per edge

Information Processing Letters

Volumn 106, Issue 3, 2008, Pages 110-114

  Baswana, Surender ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

Author keywords

Analysis of algorithms; On line algorithms; Shortest path; Spanner; Streaming

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING;

INPUT STREAM; ONLINE ALGORITHMS; SHORTEST PATHS;

GRAPH THEORY;

EID: 40449104447     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2007.11.001     Document Type: Article

References (13)

1. Althöfer I., Das G., Dobkin D.P., Joseph D., and Soares J. On sparse spanners of weighted graphs. Discrete and Computational Geometry 9 (1993) 81-100
2. Ausiello G., Demetrescu C., Franciosa P.G., Italiano G.F., and Ribichini A. Small stretch spanners in the streaming model: New algorithms and experiments. Proceedings of 15th Annual European Symposium on Algorithms. LNCS vol. 4698 (2007), Springer 605-617
3. Awerbuch B. Complexity of network synchronization. Journal of ACM (1985) 804-823
4. Baswana S., and Sen S. A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Structures and Algorithms 30 (2007) 532-563
5. Elkin M. Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. Proceedings of 13th Annual European Symposium on Algorithms. Lecture Notes in Comput. Sci. vol. 4596 (2007), Springer 716-727
6. Elkin M., and Peleg D. Strong inapproximability of the basic k-spanner problem. Proceedings of 27th International Colloquium on Automata, Languages and Programming. LNCS vol. 1853 (2000), Springer 636-648
7. Erdo{combining double acute accent}s P. Extremal problems in graph theory. Theory of Graphs and its Applications. Proc. Sympos. Smolenice vol. 1963 (1964), Publ. House Czechoslovak Acad. Sci., Prague 29-36
8. Feigenbaum J., Kannan S., McGregor A., Suri S., and Zhang J. On graph problems in a semi-streaming model. Proceedings of 31st International Colloquium on Automata, Languages and Programming. LNCS vol. 3142 (2004), Springer 531-543
9. J. Feigenbaum, S. Kannan, A. McGregor, S. Suri, J. Zhang, Graph distances in the streaming model: the value of space, in: Proceedings of 16th Annual ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 745-754
10. S. Halperin, U. Zwick, Linear time deterministic algorithm for computing spanners for unweighted graphs, unpublished manuscript, 1996
11. Henzinger M.R., Raghavan P., and Rajagopalan S. Computing on data streams. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 50 (1999) 107-118
12. McGregor A. Finding graph matchings in streaming model. Proceedings of 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. LNCS vol. 3624 (2005), Springer 170-181
13. Peleg D., and Schäffer A. Graph spanners. Journal of Graph Theory 13 (1989) 99-116