Network-Tree Model and Shortest Path Algorithm

DOI10.1007/3-540-44863-2_53MaRDI QIDQ3566799zbMATH OpenOpenAlexFDO

Authors Guozhen Tan, Xiaojun Han, Wen Gao

Publication date 10 June 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44863-2_53

zbMATH Keywords

large-scale networknetwork-tree modelroute optimization algorithmshortest path algorithm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Shortest shortest path trees of a network
• scientific article; zbMATH DE number 1182917
• Shortest Path Tree Computation in Dynamic Graphs
• Shortest Paths in a Hybrid Network Model
• A shortest path approximation algorithm for complex network analysis
• An empirical study of the structure of the shortest path tree
• Computing Shortest Paths and Diameter in the Hybrid Network Model
• Shortest-Path Routing in Arbitrary Networks
• Computing the shortest network under a fixed topology

Cited in

(4)

• A method of characterizing network topology based on the breadth-first search tree
• Shortest shortest path trees of a network
• Generalized shortest path trees: a novel graph class by example of semiotic networks
• Shortest Path Tree Computation in Dynamic Graphs

This page was built for publication: Network-Tree Model and Shortest Path Algorithm

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