Small stretch spanners in the streaming model: New algorithms and experiments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 605-617

  Ausiello, Giorgio ^a   Demetrescu, Camil ^a   Franciosa, Paolo G ^a   Italiano, Giuseppe F ^b   Ribichini, Andrea ^a  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DATA STRUCTURES; EDGE DETECTION; GRAPH THEORY;

MEMORY SPACE; STREAMING MODEL;

DATA PROCESSING;

EID: 38049073315     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_54     Document Type: Conference Paper

References (25)

1. Experimental package. See: http://www.dis.uniromal.it/~ribichini/spanner/
2. Aggarwal, G., Datar, M., Rajagopalan, S., Ruhl, M.: On the streaming model augmented with sorting primitive. In: FOCS'04, pp. 540-549 (2004)
3. Althofer, I., Das, G., Dobkin, D.P., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete & Computational Geometry 9, 81-100 (1993)
4. Ausiello, G., Franciosa, P.G., Italiano, G.F.: Small stretch spanners on dynamic graphs. Journal of Graph Algorithms and Applications 10(2), 365-385 (2006)
5. Awerbuch, B.: Complexity of network synchroniz. JACM 32(4), 804-823 (1985)
6. Baswana, S.: Dynamic algorithms for graph spanners. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 76-87. Springer, Heidelberg (2006)
7. Baswana, S.: Faster streaming algorithms for graph spanners: (2006), http://www.citebase.org/abstract?id=oaiarXiv.org:cs/0611023
8. Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: New constructions of (α, β)-spanners and purely additive spanners. In: SODA'05, pp. 672-681 (2005)
9. 1+1/k) size for weighted graphs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 384-396. Springer, Heidelberg (2003)
10. Cai, L.: NP-completeness of minimum spanner problems. Discr. Appl. Math. and Combinat. Operations Res. and Comp. Science 48(2), 187-194 (1994)
11. Cai, L., Keil, J.M.: Degree-bounded spanners. Par. Proc. Lett. 3, 457-468 (1993)
12. Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: 4th SIAM International Conference on Data Mining (2004)
13. Chew, L.P.: There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences 39(2), 205-219 (1989)
14. Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol. 401, pp. 168-192. Springer, Heidelberg (1989)
15. Dobkin, D., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete & Computational Geometry 5, 399-407 (1990)
16. Erdos, P., Rényi, A.: On random graphs. P. Math. Debrecen 6, 290-291 (1959)
17. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the streaming model: the value of space. In: SODA'05, pp. 745-754 (2005)
18. Liestman, A.L., Shermer, T.: Grid spanners. Networks 23, 122-133 (1993)
19. Liestman, A.L., Shermer, T.: Additive graph spanners. Networks, 23, 343-364 (1993)
20. Peleg, D., Shäffer, A.: Graph spanners. J. Graph Theory 13, 99-116 (1989)
21. Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM Journal on Computing 18(4), 740-747 (1989)
22. Richards, D., Liestman, A.L.: Degree-constrained pyramid spanners. JPDC: Journal of Parallel and Distributed Computing 25, 1-6 (1995)
23. Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 261-272. Springer, Heidelberg (2005)
24. Vitter, J.S.: External memory algorithms and data structures: dealing with massive data. ACM Computing Surveys 33(2), 209-271 (2001)
25. Zwick, U.: Personal communication