Indexing Network Structure with Shortest-Path Trees

  title={Indexing Network Structure with Shortest-Path Trees},
  author={Marc E. Maier and Matthew J. Rattigan and David D. Jensen},
  journal={ACM Trans. Knowl. Discov. Data},
The ability to discover low-cost paths in networks has practical consequences for knowledge discovery and social network analysis tasks. Many analytic techniques for networks require finding low-cost paths, but exact methods for search become prohibitive for large networks, and data sets are steadily increasing in size. Short paths can be found efficiently by utilizing an index of network structure, which estimates network distances and enables rapid discovery of short paths. Through… Expand
9 Citations
Decentralized Search for Shortest Path Approximation in Large-Scale Complex Networks
  • Z. Lu, Yunhe Feng, Qing Cao
  • Computer Science
  • 2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)
  • 2017
Estimating graph distance and centrality on shared nothing architectures
Optimizing B-tree search performance of big data sets / Mohsen Marjani
A survey on indexing techniques for big data: taxonomy and performance evaluation
Algorithm for time-constrained paths to deliver services


Detecting community structure in networks
Analysis of weighted networks.
  • M. Newman
  • Mathematics, Physics
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
Vivaldi: a decentralized network coordinate system