Skip to main content
SpringerLink
Log in

An Exact Algorithm for Diameters of Large Real Directed Graphs

  • Conference paper
  • First Online:
Experimental Algorithms (SEA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9125))

Included in the following conference series:

Abstract

We propose a new algorithm to compute the diameters of large real directed graphs. In contrast to recent algorithms, the proposed algorithm is designed for general directed graphs, i.e., it does not assume that given graphs are undirected or strongly connected. Experimental results on large real graphs show that the proposed algorithm is several orders of magnitude faster than the naive approach, and it reveals the exact diameters of large real directed graphs, for which only lower bounds have been known.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albert, R., Jeong, H., Barabási, A.-L.: Diameter of the World-Wide web. Nature 401(6749), 130–131 (1999)

    Article  Google Scholar 

  2. Borassi, M., Crescenzi, P., Habib, M., Kosters, W., Marino, A., Takes, F.: On the solvability of the six degrees of kevin bacon game. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) FUN 2014. LNCS, vol. 8496, pp. 52–63. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  3. Broder, A., Kumar, R., Maghoul, F., Raghavan, P., Rajagopalan, S., Stata, R., Tomkins, A., Wiener, J.: Graph Structure in the Web. Computer Networks: The International Journal of Computer and Telecommunications Networking 33(1–6), 309–320 (2000)

    Article  Google Scholar 

  4. Corneil, D.G., Dragan, F.F., Habib, M., Paul, C.: Diameter Determination on Restricted Graph Families. Discrete Applied Mathematics 113(2), 143–166 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Crescenzi, P., Grossi, R., Habib, M., Lanzi, L., Marino, A.: On Computing the Diameter of Real-World Undirected Graphs. Theoretical Computer Science 514, 84–95 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  6. Crescenzi, P., Grossi, R., Imbrenda, C., Lanzi, L., Marino, A.: Finding the diameter in real-world graphs. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 302–313. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  7. Crescenzi, P., Grossi, R., Lanzi, L., Marino, A.: On computing the diameter of real-world directed (weighted) graphs. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 99–110. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  8. Handler, G.Y.: Minimax Location of a Facility in an Undirected Tree Graph. Transportation Science 7(3), 287–293 (1973)

    Article  MathSciNet  Google Scholar 

  9. Leskovec, J., Krevl, A.: SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data

  10. Magnien, C., Latapy, M., Habib, M.: Fast Computation of Empirically Tight Bounds for the Diameter of Massive Graphs. Journal of Experimental Algorithmics 13(10), 1.10–1.9 (2009)

    Google Scholar 

  11. Milgram, S.: The Small-World Problem. Psychology Today 2(1), 60–67 (1967)

    MathSciNet  Google Scholar 

  12. Takes, F.W., Kosters, W.A.: Determining the Diameter of Small World Networks. In: CIKM, pp. 1191–1196 (2011)

    Google Scholar 

  13. Tarjan, R.: Depth-First Search and Linear Graph Algorithms. SIAM Journal on Computing 1(2), 146–160 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  14. Watts, D.J., Strogatz, S.H.: Collective Dynamics of ’Small-World’ Networks. Nature 393(6684), 440–442 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The University of Tokyo, Bunkyo, 113-0033, Japan

    Takuya Akiba, Yoichi Iwata & Yuki Kawata

Authors
  1. Takuya Akiba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoichi Iwata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yuki Kawata
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuki Kawata .

Editor information

Editors and Affiliations

  1. Université Pierre et Marie Curie LIP6, Paris, France

    Evripidis Bampis

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Akiba, T., Iwata, Y., Kawata, Y. (2015). An Exact Algorithm for Diameters of Large Real Directed Graphs. In: Bampis, E. (eds) Experimental Algorithms. SEA 2015. Lecture Notes in Computer Science(), vol 9125. Springer, Cham. https://doi.org/10.1007/978-3-319-20086-6_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-20086-6_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-20085-9

  • Online ISBN: 978-3-319-20086-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation