Indexing Network Structure with Shortest-Path Trees

@article{Maier2011IndexingNS,
  title={Indexing Network Structure with Shortest-Path Trees},
  author={Marc E. Maier and Matthew J. Rattigan and David D. Jensen},
  journal={TKDD},
  year={2011},
  volume={5},
  pages={15:1-15:25}
}
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… CONTINUE READING
4 Extracted Citations
17 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 17 references

A note on two problems in connexion with graphs

  • E. DIJKSTRA
  • Numerische Mathematik 1, 1, 269–271.
  • 1959
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…