MER INFORMATION

Computing Diameters in Slim Graphs

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.

Länka till denna publikation

Dela på webben

Skapa referens, olika format (klipp och klistra)

BibTeX @mastersthesis{Block2018,author={Block, Benjamin and Milakovic, Michael},title={Computing Diameters in Slim Graphs},abstract={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.},publisher={Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola},place={Göteborg},year={2018},keywords={Computer, approximation, computer science, thesis, algorithms, Monte Carlo algorithm, graphs, slim graphs, diameter computation},note={45},}

RefWorks RT GenericSR ElectronicID 255208A1 Block, BenjaminA1 Milakovic, MichaelT1 Computing Diameters in Slim GraphsYR 2018AB 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.PB Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola,PB Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola,LA engLK http://publications.lib.chalmers.se/records/fulltext/255208/255208.pdfOL 30