Mostra el registre d'ítem simple
Fast, exact graph diameter computation with vertex programming
dc.contributor.author | Pennycuff, Corey |
dc.contributor.author | Weninger, Tim |
dc.date.accessioned | 2015-07-29T08:28:55Z |
dc.date.available | 2015-07-29T08:28:55Z |
dc.date.issued | 2015 |
dc.identifier.citation | Pennycuff, 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.identifier.uri | http://hdl.handle.net/2117/76371 |
dc.description.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. |
dc.format.extent | 7 p. |
dc.language.iso | eng |
dc.publisher | Barcelona Supercomputing Center |
dc.relation.ispartof | High Performance Graph Mining workshop (1st: 2015: Sydney) |
dc.rights | Attribution-ShareAlike 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-sa/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística::Matemàtica discreta::Teoria de grafs |
dc.subject.lcsh | Algorithm |
dc.subject.other | Vertex-centric computing |
dc.subject.other | graph analytics |
dc.subject.other | diameter |
dc.title | Fast, exact graph diameter computation with vertex programming |
dc.type | Conference report |
dc.subject.lemac | Algorismes |
dc.subject.lemac | Grafs, Teoria de |
dc.identifier.doi | 10.5821/hpgm15.2 |
dc.rights.access | Open Access |
local.citation.contributor | HPGM: High Performance Graph Mining |
local.citation.publicationName | 1st High Performance Graph Mining workshop, Sydney, 10 August 2015 |