Disk-based shortest path discovery using distance index over large dynamic graphs

DOI10.1016/j.ins.2016.12.013zbMath1429.68191OpenAlexW2567197845MaRDI QIDQ2292955

Yongkoo Han, Dawanga Vonvou, Mostofa Kamal Rasel, Jihye Hong, Young-Koo Lee, Kisung Park

Publication date: 6 February 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.12.013

zbMATH Keywords

graph searchingdynamic graphslarge graphsshortest path discovery

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• MapReduce
• gSpan
• GraphLab
• Pregel
• PowerGraph

Cites Work

• A note on two problems in connexion with graphs
• From the Cover: The structure of scientific collaboration networks
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• Speed-Up Techniques for Shortest-Path Computations
• Incremental algorithms for minimal length paths
• Compact roundtrip routing in directed networks
• Collective dynamics of ‘small-world’ networks
• A new approach to dynamic all pairs shortest paths
• Faster shortest-path algorithms for planar graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Disk-based shortest path discovery using distance index over large dynamic graphs