Finding the shortest paths by node combination
From MaRDI portal
Publication:632873
DOI10.1016/J.AMC.2011.01.019zbMATH Open1211.90262OpenAlexW1969743129MaRDI QIDQ632873FDOQ632873
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
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
- Network flows. Theory, algorithms, and applications.
- A note on two problems in connexion with graphs
- Complex networks: structure and dynamics
- Title not available (Why is that?)
- Introduction to algorithms.
- The Structure and Function of Complex Networks
- On a routing problem
- Fibonacci heaps and their uses in improved network optimization algorithms
- Collective dynamics of ‘small-world’ networks
- A Theorem on Boolean Matrices
- Handbook of applied optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Shortest paths algorithms: Theory and experimental evaluation
- An improved Dijkstra's shortest path algorithm for sparse network
- An extension of labeling techniques for finding shortest path trees
- Experimental and Efficient Algorithms
- Network Optimization Problems: Algorithms, Applications and Complexity
- Title not available (Why is that?)
Cited In (10)
- Title not available (Why is that?)
- Clifford algebra method for network expression, computation, and algorithm construction
- Finding an induced path that is not a shortest path
- Title not available (Why is that?)
- 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
- Finding the Anti-block Vital Edge of a Shortest Path Between Two Nodes
Uses Software
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)
