In English

Computing Diameters in Slim Graphs

Benjamin Block ; Michael Milakovic
Göteborg : Chalmers tekniska högskola, 2018. 45 s.
[Examensarbete på avancerad nivå]

With the use of large graphs with n vertices and m edges, the current approach for computing the diameter is not efficient. We have investigated a special graph class, namely slim graphs. Slim graphs are graphs whose diameter is at least some fixed fraction of the number of vertices. This constraint allows us to prove structural features in these special graphs. Using these features, we have developed three algorithms which are asymptotically superior to diameter computation in the general case. We present the following three algorithms, for a fixed 0 < k < 1/2: a (1 − k)- approximation algorithm of the diameter in O(n+m) time; a deterministic algorithm which computes the diameter in O(n2) time and a Monte Carlo algorithm which also computes the diameter in O(n2) time.

Nyckelord: Computer, approximation, computer science, thesis, algorithms, Monte Carlo algorithm, graphs, slim graphs, diameter computation



Publikationen registrerades 2018-06-26. Den ändrades senast 2018-06-26

CPL ID: 255208

Detta är en tjänst från Chalmers bibliotek