Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,159,869 papers from all fields of science
Search
Sign In
Create Free Account
Shortest path problem
Known as:
Singledestination shortest path problem
, Shortest path routing
, Single-destination shortest path problem
Expand
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
Abstract machine
Andrew V. Goldberg
Auction algorithm
Bidirectional search
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Construction of cellular automata over hexagonal and triangular tessellations for path planning of multi-robots
Jasmeena Tariq
,
A. Kumaravel
International Conference on Computational…
2016
Corpus ID: 21622064
Exploring unknown terrains demand for the sophisticated algorithms for path planning in case of multi-robot systems. Robots…
Expand
2006
2006
Locating Sensors in Concave Areas
Chen Wang
,
Li Xiao
Proceedings IEEE INFOCOM . 25TH IEEE…
2006
Corpus ID: 8882975
In sensor network localization, multihop based approaches were proposed to approximate the shortest paths to Euclidean distances…
Expand
2000
2000
Quality of service routing in ad hoc networks
G. Raju
,
G. Hernandez
,
Q. Zou
IEEE Wireless Communications and Networking…
2000
Corpus ID: 38124269
Current generation routing protocols for ad hoc networks typically use shortest path routing. Examples include on-demand routing…
Expand
1998
1998
Updating Shortest Paths
S. Edelkamp
European Conference on Artificial Intelligence
1998
Corpus ID: 6611752
Stefan Edelkamp 1 Abstract. Moving target search is a state space approach for nding non-stationary goals. The plot is given by a…
Expand
1995
1995
Direction weighted shortest path planning
J. Sellen
Proceedings of IEEE International Conference on…
1995
Corpus ID: 12745967
We examine shortest path planning under a direction weighted Euclidean metric, motivated by the problem of finding optimal routes…
Expand
1993
1993
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes
S. Tien
,
C. Raghavendra
IEEE Trans. Parallel Distributed Syst.
1993
Corpus ID: 4476080
In an n-dimensional hypercube Qn, with the fault set mod F mod >2/sub n-2/, assuming Sand D are not isolated, it is shown that…
Expand
1990
1990
Efficient Shortest Path Simplex Algorithms
D. Goldfarb
,
Jianxiu Hao
,
Sheng-Roan Kai
Operational Research
1990
Corpus ID: 35058269
We consider the specialization of the primal simplex algorithm to the problem of finding a tree of directed shortest paths from a…
Expand
1990
1990
A Shortest Paths Ranking Algorithm
E. Martins
,
F. Pires
1990
Corpus ID: 17988471
: The ranking of K shortest paths is a classical network optimization problem with a large range of real world applications. Take…
Expand
1987
1987
Lower Bounds for Shortest Path and Related Problems
J. Canny
,
J. Reif
1987
Corpus ID: 9864525
We present the rst lower bounds for shortest path problems (including euclidean shortest path) in three dimensions, and for some…
Expand
1976
1976
Sparse matrix techniques for the shortest path problem
S. Goto
,
T. Ohtsuki
,
T. Yoshimura
1976
Corpus ID: 195701983
Two methods of implementing computer programs for solving the shortest path problem are presented. By symbolic processing, a…
Expand