Efficient single-pair all-shortest-path query processing for massive dynamic networks

DOI10.1016/j.ins.2020.08.111zbMath1475.68114OpenAlexW3087919015MaRDI QIDQ2055599

Sungkil Lee, Sun Geol Baek, Young Ik Eom

Publication date: 1 December 2021

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

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

zbMATH Keywords

shortest pathsgraph query processingincremental maintenance

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20)

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• A note on two problems in connexion with graphs
• A new approach to all-pairs shortest paths on real-weighted graphs
• Computing source-to-target shortest paths for complex networks in RDBMS
• Computing All-Pairs Shortest Paths by Leveraging Low Treewidth
• On a routing problem
• Finding the k Shortest Paths
• Reachability and Distance Queries via 2-Hop Labels
• Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm
• Faster all-pairs shortest paths via circuit complexity
• Finding the K Shortest Loopless Paths in a Network
• A Theorem on Boolean Matrices

This page was built for publication: Efficient single-pair all-shortest-path query processing for massive dynamic networks