Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,595,727 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.
2006
2006
Locating Sensors in Concave Areas
Chen Wang
,
Xiao Li
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
2005
2005
Detecting Blackhole Attack in Mobile Ad Hoc Networks
Bo Sun
,
Yong Guan
,
Jian Chen
,
U. Pooch
2005
Corpus ID: 18959421
Mobile Ad-hoc NETworks (MANETS) have seen tremendous gmwth in recent years. It is a new paradigm of communication’ in which t h m…
Expand
2004
2004
Investigating Ahuja-Orlin''s Large Neighbourhood Search for Examination Timetabling
S. Abdullah
,
S. Ahmadi
,
E. Burke
2004
Corpus ID: 7716719
: Since the 1960’s automated approaches to examination timetabling have been explored and a wide variety of approaches have been…
Expand
Review
2002
Review
2002
Algorithm and its application to N shortest paths problem
C. Deng
2002
Corpus ID: 124686404
As the shortest path denotes one path, algorithms designed for shortest path problem can get only one path. N shortest paths are…
Expand
1998
1998
Updating Shortest Paths
Stefan 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
Highly Cited
1994
Highly Cited
1994
A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
Mayiz B. Habbal
,
H. Koutsopoulos
,
S. Lerman
Transportation Science
1994
Corpus ID: 23460528
The shortest path problem is a classical and important combinatorial problem with many applications. We examine the solution of…
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
1993
1993
Clock period minimization with wave pipelining
Donald A. Joy
,
M. Ciesielski
IEEE Trans. Comput. Aided Des. Integr. Circuits…
1993
Corpus ID: 19865374
A method using a linear program for adjusting clock delays in individual flip-flops to minimize the clock period through the use…
Expand
1990
1990
A Shortest Paths Ranking Algorithm
Ernesto de Queirós Vieira 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
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