A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space

DOI10.3233/FI-2009-113zbMATH Open1183.68725OpenAlexW1790884051MaRDI QIDQ3398971FDOQ3398971

Authors: Ling Zhang, Fugui He, YanPing Zhang, Shu Zhao 

Publication date: 29 September 2009

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2009-113

Recommendations

• Computing the shortest path: \(A^\ast\) search meets graph theory
• A shortest path approximation algorithm for complex network analysis
• A parallel shortest path algorithm
• A novel linear algorithm for shortest paths in networks
• A computational improvement for a shortest paths ranking algorithm

zbMATH Keywords

graph clusteringshortest pathquotient graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited In (4)

• A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network
• A low complexity method for the optimization of network path length in spatially embedded networks
• MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS
• A shortest path approximation algorithm for complex network analysis

This page was built for publication: A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space

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