Fast, exact graph diameter computation with vertex programming

View/Open
Document typeConference report
Defense date2015
PublisherBarcelona Supercomputing Center
Rights accessOpen Access
Abstract
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.
CitationPennycuff, 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.
Files | Description | Size | Format | View |
---|---|---|---|---|
hpgm_15_2.pdf | 522,0Kb | View/Open |
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-ShareAlike 3.0 Spain