Skip to main content
SpringerLink
Log in

Fast and Simple Approximation of the Diameter and Radius of a Graph

  • Conference paper
Experimental Algorithms (WEA 2006)

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

Included in the following conference series:

Abstract

The increasing amount of data to be processed by computers has led to the need for highly efficient algorithms for various computational problems. Moreover, the algorithms should be as simple as possible to be practically applicable. In this paper we propose a very simple approximation algorithm for finding the diameter and the radius of an undirected graph. The algorithm runs in \(O(m\sqrt{n})\) time and gives an additive error of \(O(\sqrt{n})\) for a graph with n vertices and m edges. Practical experiments show that the results of our algorithm are close to the optimum and compare favorably to the 2/3-approximation algorithm for the diameter problem by Aingworth et al [1].

This work is partially supported by ESF (European Social Fund).

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. Aingworth, D., Chekuri, C., Indyk, P., Motwani, R.: Fast Estimation of Diameter and Shortest Paths (without Matrix Multiplication). SIAM J. on Computing 28, 1167–1181 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  2. Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An Experimental Comparison of Three Graph Drawing Algorithms. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 306–315 (1995)

    Google Scholar 

  3. Brandstädt, A., Chepoi, V.D., Dragan, F.F.: The Algorithmic Use of Hyper-Tree Structure and Maximum Neighborhood Orderings. In: Mayr, E.W., Schmidt, G., Tinhofer, G. (eds.) WG 1994. LNCS, vol. 903, pp. 65–80. Springer, Heidelberg (1995)

    Google Scholar 

  4. Chartrand, G., Lesniak, L.: Graphs & Digraphs. Chapman & Hall, Boca Raton (1996)

    MATH  Google Scholar 

  5. Chung, F.R.K.: Diameters of Graphs: Old Problems and New Results. Congressus Numerantium 60, 295–317 (1987)

    MathSciNet  Google Scholar 

  6. Coppersmith, D., Winograd, S.: Matrix Multiplication via Arithmetic Progression. In: Proc 19th ACM Symp on Theory of Computing, pp. 1–6 (1987)

    Google Scholar 

  7. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  8. Corneil, D.G., Dragan, F.F., Köhler, E.: On the Power of BFS to Determine a Graph’s Diameter. Networks 42(4), 209–222 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Dor, D., Halperin, S., Zwick, U.: All Pairs Almost Shortest Paths. Electronic Colloquium on Computational Complexity 4 (1997)

    Google Scholar 

  10. Dragan, F.F.: Dominating Cliques in Distance-Hereditary Graphs. In: Schmidt, E.M., Skyum, S. (eds.) SWAT 1994. LNCS, vol. 824, pp. 370–381. Springer, Heidelberg (1994)

    Google Scholar 

  11. Dragan, F.F., Nicolai, F.: LexBFS-orderings of Distance-Hereditary Graphs with Application to the Diametral Pair Problem. Discrete Appl. Math. 98, 191–207 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dragan, F.F., Nicolai, F., Brandstädt, A.: LexBFS-orderings and Powers of Graphs. In: D’Amore, F., Marchetti-Spaccamela, A., Franciosa, P.G. (eds.) WG 1996. LNCS, vol. 1197, pp. 166–180. Springer, Heidelberg (1997)

    Google Scholar 

  13. Farley, A.M., Proskurowsky, A.: Computation of the Center and Diameter of Outerplanar Graphs. Discrete Appl. Math. 2, 185–191 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  14. Handler, G.: Minimax Location of a Facility in an Undirected Tree Graph. Transp. Sci. 7, 287–293 (1973)

    Article  MathSciNet  Google Scholar 

  15. Olariu, S.: A Simple Linear-Time Algorithm for Computing the Center of an Interval Graph. Int. J. Comput. Math. 34, 121–128 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  16. Rose, D., Tarjan, R.E., Lueker, G.: Algorithmic Aspects of Vertex Elimination on Graphs. SIAM J. Comput. 5, 266–283 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  17. Sedgewick, R.: Algorithms in C, Part 5: Graph Algorithms, 3rd edn. Addison-Wesley, Reading (2002)

    Google Scholar 

  18. Seidel, R.: On the All-Pair-Shortest-Paths Problem. In: Proc 24th ACM Symp. on Theory of Computing, pp. 745–749 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and ComputerScience, University of Latvia, Rainis blvd. – 29, Riga, Latvia

    Krists Boitmanis, Kārlis Freivalds, Pēteris Lediņš & Rūdolfs Opmanis

Authors
  1. Krists Boitmanis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kārlis Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pēteris Lediņš
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Rūdolfs Opmanis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Software Department, Edifici Omega, Universitat Politècnica de Catalunya, Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    Carme Àlvarez

  2. ALBCOM Research Group, Universitat Politècnica de Catalunya, Edifici Ω, Campus Nord, Jordi Girona, 1-3, 08034, Barcelona, Spain

    María Serna

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Boitmanis, K., Freivalds, K., Lediņš, P., Opmanis, R. (2006). Fast and Simple Approximation of the Diameter and Radius of a Graph. In: Àlvarez, C., Serna, M. (eds) Experimental Algorithms. WEA 2006. Lecture Notes in Computer Science, vol 4007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11764298_9

Download citation

  • DOI: https://doi.org/10.1007/11764298_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34597-8

  • Online ISBN: 978-3-540-34598-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation