Show simple item record

dc.contributor.authorPennycuff, Corey
dc.contributor.authorWeninger, Tim
dc.identifier.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.
dc.description.abstractIn 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.
dc.format.extent7 p.
dc.publisherBarcelona Supercomputing Center
dc.relation.ispartofHigh Performance Graph Mining workshop (1st: 2015: Sydney)
dc.rightsAttribution-ShareAlike 3.0 Spain
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs
dc.subject.otherVertex-centric computing
dc.subject.othergraph analytics
dc.titleFast, exact graph diameter computation with vertex programming
dc.typeConference report
dc.subject.lemacGrafs, Teoria de
dc.rights.accessOpen Access
upcommons.citation.contributorHPGM: High Performance Graph Mining
upcommons.citation.publicationName1st High Performance Graph Mining workshop, Sydney, 10 August 2015

Files in this item


This item appears in the following Collection(s)

Show simple item record

Except where otherwise noted, content on this work is licensed under a Creative Commons license: Attribution-ShareAlike 3.0 Spain