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={ACM Trans. Knowl. Discov. Data},
  year={2011},
  volume={5},
  pages={15:1-15:25}
}
  • Marc E. Maier, Matthew J. Rattigan, David D. Jensen
  • Published 2011
  • Computer Science
  • 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… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-9 OF 9 CITATIONS

    Decentralized Search for Shortest Path Approximation in Large-Scale Complex Networks

    • Zheng Lu, Yunhe Feng, Qing Cao
    • Computer Science
    • 2017 IEEE International Conference on Cloud Computing Technology and Science (CloudCom)
    • 2017
    VIEW 1 EXCERPT
    CITES METHODS

    Algorithm for time-constrained paths to deliver services

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-3 OF 3 REFERENCES

    Detecting community structure in networks

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Analysis of weighted networks.

    • Micaleah Newman
    • Mathematics, Physics, Medicine
    • Physical review. E, Statistical, nonlinear, and soft matter physics
    • 2004
    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Vivaldi: a decentralized network coordinate system

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL