Finding the shortest paths by node combination

DOI10.1016/J.AMC.2011.01.019MaRDI QIDQ632873zbMATH OpenOpenAlexFDO

Authors Xin Lu, Martin Camitz

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)

Recommendations

• Dijkstra's shortest-path algorithm in a network with variable weight matrices
• Shortest path problem with multiple shortest paths
• An improvement of Dijkstra's method for finding a shortest path in a graph
• scientific article; zbMATH DE number 4066938
• A two-phase shortest path algorithm for networks with node coordinates

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• scientific article; zbMATH DE number 3302127 (Why is no real title available?)
• A Theorem on Boolean Matrices
• A note on two problems in connexion with graphs
• An extension of labeling techniques for finding shortest path trees
• An improved Dijkstra's shortest path algorithm for sparse network
• Collective dynamics of `small-world' networks
• Complex networks: structure and dynamics
• Experimental and Efficient Algorithms
• Fibonacci heaps and their uses in improved network optimization algorithms
• Handbook of applied optimization
• Introduction to algorithms.
• Network Optimization Problems: Algorithms, Applications and Complexity
• Network flows. Theory, algorithms, and applications.
• On a routing problem
• Shortest paths algorithms: Theory and experimental evaluation
• The Structure and Function of Complex Networks

Cited in

(10)

• Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes
• scientific article; zbMATH DE number 6280003 (Why is no real title available?)
• Clifford algebra method for network expression, computation, and algorithm construction
• Finding an induced path that is not a shortest path
• scientific article; zbMATH DE number 1796972 (Why is no real title available?)
• Finding a contra-risk path between two nodes in undirected graphs
• Finding next-to-shortest paths in a graph
• Finding paths with minimum shared edges
• On the union of intermediate nodes of shortest paths
• Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment

Describes a project that uses

Uses Software

• Algorithm 97

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

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