Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,540,518 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
2011
2011
BAAP: Blackhole attack avoidance protocol for wireless network
Saurabh Gupta
,
Subrat Kar
,
S. Dharmaraja
International Conference on Computing and…
2011
Corpus ID: 15614800
The lack of centralised infrastructure in adhoc network makes it vulnerable to various attacks. MANET routing disrupts if the…
Expand
2009
2009
Association between nodes to combat blackhole attack in DSR based MANET
N. Bhalaji
,
A. Shanmugam
IFIP International Conference on Wireless and…
2009
Corpus ID: 11469989
Mobile adhoc network (MANET) has become an exciting and important technology in recent years because of the rapid proliferation…
Expand
Highly Cited
2008
Highly Cited
2008
A novel delay-aware routing algorithm (DARA) for a hybrid wireless-optical broadband access network (WOBAN)
S. Sarkar
,
Hong-Hsu Yen
,
S. Dixit
,
B. Mukherjee
IEEE Network
2008
Corpus ID: 17303198
A hybrid wireless-optical broadband access network (WOBAN) is a promising architecture for future access networks. Recently, the…
Expand
Highly Cited
2008
Highly Cited
2008
Alleviating Congestion Using Traffic-Aware Dynamic Routing in Wireless Sensor Networks
Tao He
,
Fengyuan Ren
,
Chuang Lin
,
Sajal K. Das
Annual IEEE Communications Society Conference on…
2008
Corpus ID: 16461626
The congestion problem in wireless sensor networks (WSNs) is quite different from that in traditional networks. Most current…
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
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
1990
1990
Efficient Shortest Path Simplex Algorithms
D. Goldfarb
,
Jianxiu Hao
,
S. 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
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
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE