Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Graph Spanners in the Streaming Model: An Experimental Study

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

This article reports the results of an extensive experimental analysis of efficient algorithms for computing graph spanners in the data streaming model, where an (α,β)-spanner of a graph G is a subgraph S⊆G such that for each pair of vertices the distance in S is at most α times the distance in G plus β. To the best of our knowledge, this is the first computational study of graph spanner algorithms in a streaming setting. We compare experimentally the randomized algorithms proposed by Baswana (http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0611023) and by Elkin (In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Wroclaw, Poland, pp. 716–727, 9–13 July 2007) for general stretch factors with the deterministic algorithm presented by Ausiello et al. (In: Proceedings of the 15th Annual European Symposium on Algorithms (ESA 2007), Engineering and Applications Track, Eilat, Israel, 8–10 October 2007. LNCS, vol. 4698, pp. 605–617, 2007), designed for building small stretch spanners. All the algorithms we implemented work in a data streaming model where the input graph is given as a stream of edges in arbitrary order, and all of them need a single pass over the data. Differently from the algorithm in Ausiello et al., the algorithms in Baswana (http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0611023) and Elkin (In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Wroclaw, Poland, pp. 716–727, 9–13 July 2007) need to know in advance the number of vertices in the graph.

The results of our experimental investigation on several input families confirm that all these algorithms are very efficient in practice, finding spanners with stretch and size much smaller than the theoretical bounds and comparable to those obtainable by off-line algorithms. Moreover, our experimental findings confirm that small values of the stretch factor are the case of interest in practice, and that the algorithm by Ausiello et al. tends to produce spanners of better quality than the algorithms by Baswana and Elkin, while still using a comparable amount of time and space resources.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Experimental package. Available at http://www.dis.uniroma1.it/~ribichini/spanner/

  2. Aggarwal, G., Datar, M., Rajagopalan, S., Ruhl, M.: On the streaming model augmented with sorting primitive. In: Proc. FOCS’04, pp. 540–549 (2004)

  3. Albert, R.: Scale-free networks in cell biology. J. Cell Sci. 118, 4947–4957 (2005)

    Article  Google Scholar 

  4. Althofer, I., Das, G., Dobkin, D.P., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9, 81–100 (1993)

    Article  MathSciNet  Google Scholar 

  5. Ausiello, G., Demetrescu, C., Franciosa, P.G., Italiano, G.F., Ribichini, A.: Small stretch spanners in the streaming model: New algorithms and experiments. In: Proceedings of the 15th Annual European Symposium on Algorithms (ESA 2007), Engineering and Applications Track, Eilat, Israel, 8–10 October 2007. LNCS, vol. 4698, pp. 605–617. Springer, Berlin (2007)

    Google Scholar 

  6. Ausiello, G., Franciosa, P.G., Italiano, G.F.: Small stretch spanners on dynamic graphs. J. Graph Algorithms Appl. 10(2), 365–385 (2006)

    MATH  MathSciNet  Google Scholar 

  7. Awerbuch, B.: Complexity of network synchronization. J. ACM 32(4), 804–823 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  8. Baswana, S.: Dynamic algorithms for graph spanners. In: Proc. ESA’06, pp. 76–87 (2006)

  9. Baswana, S.: Faster streaming algorithms for graph spanners (2006). http://www.citebase.org/abstract?id=oai:arXiv.org:cs/0611023

  10. Baswana, S., Kavitha, T., Mehlhorn, K., Pettie, S.: New constructions of (α, β)-spanners and purely additive spanners. In: Proc. SODA’05, pp. 672–681 (2005)

  11. Baswana, S., Sen, S.: A simple linear time algorithm for computing (2k−1)-spanner of O(n 1+1/k) size for weighted graphs. In: Proc. ICALP’03, pp. 384–396 (2003)

  12. Buriol, L., Frahling, G., Leonardi, S., Marchetti-Spaccamela, A., Sohler, C.: Counting triangles in data streams. In: Proceedings of the 25th ACM Symposium on Principles of Database Systems (PODS’06), pp. 253–262 (2006)

  13. Cai, L.: NP-completeness of minimum spanner problems. Discrete Appl. Math. Combin. Oper. Res. Comput. Sci. 48(2), 187–194 (1994)

    Article  MATH  Google Scholar 

  14. Cai, L., Keil, J.M.: Degree-bounded spanners. Parallel Process. Lett. 3, 457–468 (1993)

    Article  MathSciNet  Google Scholar 

  15. Chakrabarti, D., Zhan, Y., Faloutsos, C.: R-MAT: A recursive model for graph mining. In: Proceedings of the 4th SIAM International Conference on Data Mining (2004)

  16. Chew, L.P.: There are planar graphs almost as good as the complete graph. J. Comput. Syst. Sci. 39(2), 205–219 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  17. Das, G., Joseph, D.: Which triangulations approximate the complete graph? In: Proc. Int. Symp. on Optimal Algorithms. LNCS, vol. 401, pp. 168–192. Springer, Berlin (1989)

    Google Scholar 

  18. Dobkin, D., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. Discrete Comput. Geom. 5, 399–407 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  19. Elkin, M.: Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners. In: Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), Wroclaw, Poland, pp. 716–727, 9–13 July 2007

  20. Elkin, M., Zhang, J.: Efficient algorithms for constructing (1+ε,β)-spanners in the distributed and streaming models. Distrib. Comput. 18(5), 375–385 (2006)

    Article  Google Scholar 

  21. Erdős, P., Rényi, A.: On random graphs. Publ. Math. Debrecen 6, 290–291 (1959)

    MathSciNet  Google Scholar 

  22. Faloutsos, M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the internet topology. In: SIGCOMM ’99: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, New York, NY, USA, pp. 251–262. ACM Press, New York (1999)

    Chapter  Google Scholar 

  23. Feigenbaum, J., Kannan, S., McGregor, A., Suri, S., Zhang, J.: Graph distances in the streaming model: the value of space. In: Proc. SODA’05, pp. 745–754 (2005)

  24. Liestman, A.L., Shermer, T.: Additive graph spanners. Networks 23, 343–364 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  25. Liestman, A.L., Shermer, T.: Grid spanners. Networks 23, 122–133 (1993)

    Google Scholar 

  26. Peleg, D., Shäffer, A.: Graph spanners. J. Graph Theory 13, 99–116 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  27. Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18(4), 740–747 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  28. Richards, D., Liestman, A.L.: Degree-constrained pyramid spanners. JPDC: J. Parallel Distrib. Comput. 25, 1–6 (1995)

    Article  Google Scholar 

  29. Roditty, L., Thorup, M., Zwick, U.: Deterministic constructions of approximate distance oracles and spanners. In: Proc. ICALP’05, pp. 261–272 (2005)

  30. Zwick, U.: Personal communication

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma, via Ariosto 25, 00185, Roma, Italy

    Giorgio Ausiello, Camil Demetrescu & Andrea Ribichini

  2. Dipartimento di Statistica, Probabilità e Statistiche Applicate, Sapienza Università di Roma, piazzale Aldo Moro 5, 00185, Roma, Italy

    Paolo G. Franciosa

  3. Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, via del Politecnico 1, 00133, Roma, Italy

    Giuseppe F. Italiano

Authors
  1. Giorgio Ausiello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Camil Demetrescu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo G. Franciosa
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Giuseppe F. Italiano
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Andrea Ribichini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Camil Demetrescu.

Additional information

Work partially supported by the Italian Ministry of University and Research under Project MAINSTREAM “Algorithms for Massive Information Structures and Data Streams”. A preliminary version of this paper was presented at the 15th Annual European Symposium on Algorithms (ESA 2007) 5.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ausiello, G., Demetrescu, C., Franciosa, P.G. et al. Graph Spanners in the Streaming Model: An Experimental Study. Algorithmica 55, 346–374 (2009). https://doi.org/10.1007/s00453-008-9216-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-008-9216-9

Keywords

Search

Navigation