GraphRay: Distributed pathfinder network scaling

Alessio Arleo, Oh Hyun Kwon, Kwan-Liu Ma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations


Pathfinder network scaling is a graph sparsification technique that has been popularly used due to its efficacy of extracting the 'important' structure of a graph. However, existing algorithms to compute the pathfinder network (PFNET) of a graph have prohibitively expensive time complexity for large graphs: O(n3) for the general case and O(n2 log n) for a specific parameter setting, PFNET(r = ∞, q = n - 1), which is considered in many applications. In this paper, we introduce the first distributed technique to compute the pathfinder network with the specific parameters (r = ∞ and q = n - 1) of a large graph with millions of edges. The results of our experiments show our technique is scalable; it efficiently utilizes a parallel distributed computing environment, reducing the running times as more processing units are added.

Original languageEnglish (US)
Title of host publication2017 IEEE 7th Symposium on Large Data Analysis and Visualization, LDAV 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages10
ISBN (Electronic)9781538606179
StatePublished - Dec 19 2017
Event7th IEEE Symposium on Large Data Analysis and Visualization, LDAV 2017 - Phoenix, United States
Duration: Oct 2 2017 → …


Other7th IEEE Symposium on Large Data Analysis and Visualization, LDAV 2017
Country/TerritoryUnited States
Period10/2/17 → …

ASJC Scopus subject areas

  • Hardware and Architecture
  • Information Systems
  • Media Technology
  • Library and Information Sciences


Dive into the research topics of 'GraphRay: Distributed pathfinder network scaling'. Together they form a unique fingerprint.

Cite this