Fast, exact graph diameter computation with vertex programming

Ver/Abrir
Cita com:
hdl:2117/76371
Tipo de documentoTexto en actas de congreso
Fecha de publicación2015
EditorBarcelona Supercomputing Center
Condiciones de accesoAcceso abierto
Salvo que se indique lo contrario, los contenidos
de esta obra estan sujetos a la licencia de Creative Commons
:
Reconocimiento-CompartirIgual 3.0 España
Resumen
In graph theory the diameter is an important topological
metric for understanding size and density of a graph. Unfortunately,
the graph diameter is computationally di cult
to measure for even moderately-sized graphs, insomuch that
approximation algorithms are commonly used instead of exact
measurements. In this paper, we present a new algorithm
to measure the exact diameter of unweighted graphs
using vertex programming, which is easily distributed. We
also show the practical performance of the algorithm in
comparison to other, widely available algorithms and implementations,
as well as the unreliability in accuracy of some
pseudo-diameter estimators.
CitaciónPennycuff, Corey; Weninger, Tim. Fast, Exact Graph Diameter Computation with Vertex Programming. A: High Performance Graph Mining. "1st High Performance Graph Mining workshop, Sydney, 10 August 2015", 2015.
Ficheros | Descripción | Tamaño | Formato | Ver |
---|---|---|---|---|
hpgm_15_2.pdf | 522,0Kb | Ver/Abrir |