Computing giant graph diameters
Paper in proceedings, 2016

This paper is devoted to the fast and exact diameter computation in graphs with n vertices and m edges, if the diameter is a large fraction of n. We give an optimal O(m+n) time algorithm for diameters above n/2. The problem changes its structure at diameter value n/2, as large cycles may be present. We propose a randomized O(m+n log n) time algorithm for diameters above n/3.

Author

Peter Damaschke

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

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

03029743 (ISSN) 16113349 (eISSN)

Vol. 9843 373-384

Roots

Basic sciences

Subject Categories

Computer Science

DOI

10.1007/978-3-319-44543-4_29

ISBN

978-3-319-44543-4

More information

Created

10/7/2017