Finding the shortest paths by node combination

DOI10.1016/j.amc.2011.01.019zbMath1211.90262OpenAlexW1969743129MaRDI QIDQ632873

Martin Camitz, Xin Lu

Publication date: 28 March 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2011.01.019

zbMATH Keywords

Dijkstra's algorithmweight matrix

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment ⋮ Clifford algebra method for network expression, computation, and algorithm construction

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• An improved Dijkstra's shortest path algorithm for sparse network
• An extension of labeling techniques for finding shortest path trees
• Shortest paths algorithms: Theory and experimental evaluation
• Complex networks: structure and dynamics
• On a routing problem
• The Structure and Function of Complex Networks
• Network Optimization Problems: Algorithms, Applications and Complexity
• Fibonacci heaps and their uses in improved network optimization algorithms
• Collective dynamics of ‘small-world’ networks
• Experimental and Efficient Algorithms
• A Theorem on Boolean Matrices

This page was built for publication: Finding the shortest paths by node combination