An all pairs shortest path algorithm for dynamic graphs

MaRDI QIDQ5212359zbMATH OpenFDO

Authors Muteb Alshammari, Abdelmounaam Rezgui

Publication date 28 January 2020

Full work available at URL http://ijmcs.future-in-tech.net/15.1/R-Alshammari.pdf

zbMATH Keywords

APSPdynamic graphsshortest paths

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90)

Recommendations

• A single-source shortest path algorithm for dynamic graphs
• Efficient single-pair all-shortest-path query processing for massive dynamic networks
• Shortest paths on dynamic graphs
• scientific article; zbMATH DE number 7266346
• A new approach to dynamic all pairs shortest paths

Cited in

(11)

• Efficient single-pair all-shortest-path query processing for massive dynamic networks
• Disk-based shortest path discovery using distance index over large dynamic graphs
• Computing source-to-target shortest paths for complex networks in RDBMS
• Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality
• Boosting the exploration of huge dynamic graphs
• scientific article; zbMATH DE number 5289563 (Why is no real title available?)
• A new approach to dynamic all pairs shortest paths
• A single-source shortest path algorithm for dynamic graphs
• scientific article; zbMATH DE number 7266346 (Why is no real title available?)
• scientific article; zbMATH DE number 6469167 (Why is no real title available?)
• A priority queue for the all pairs shortest path problem

This page was built for publication: An all pairs shortest path algorithm for dynamic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212359)