Finding the shortest paths by node combination-Reference-Cited by-同舟云学术

Finding the shortest paths by node combination

Published:2011-03 Issue:13 Volume:217 Page:6401-6408
ISSN:0096-3003
Container-title:Applied Mathematics and Computation
language:en
Short-container-title:Applied Mathematics and Computation

Author:

Lu Xin,Camitz Martin

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Mathematics

Reference27 articles.

1. Shortest path algorithms;Gallo;Annals of Operations Research,1988

2. Introduction to Graph Theory;West,2001

3. D.Z. Du, P.M. Pardalos (Eds.), Network Optimization Problems: Algorithms, Applications and Complexity, World Scientific, Series on Applied Mathematics, vol. 2, 1993.

4. Handbook of Applied Optimization,2002

5. A note on two problems in connection with graphs;Dijkstra;Numerische Mathematik,1959

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithm Based on Morphological Operators for Shortness Path Planning;Algorithms;2024-04-29

2. Stepwise benchmarking based on production function: Selecting path towards closest target;Expert Systems with Applications;2023-10

3. Resonance algorithm: an intuitive algorithm to find all shortest paths between two nodes;Complex & Intelligent Systems;2022-12-26

4. Wheelchair Navigation System using Node Combination Technique for People with Motor Disabilities;2021 The 13th International Conference on Computer Modeling and Simulation;2021-06-25

5. Fuzzy Constrained Shortest Path Problem for Location-Based Online Services;International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems;2021-04