Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,724,585 papers from all fields of science
Search
Sign In
Create Free Account
Suurballe's algorithm
In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weighted…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Dijkstra's algorithm
Directed graph
Edge disjoint shortest pair algorithm
Fibonacci heap
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Evaluation of algorithms for multipath route selection over the Internet
Fabian Helfert
,
H. Niedermayer
,
G. Carle
Conference on Innovation in Clouds, Internet and…
2018
Corpus ID: 49559351
Resilience as well as other objectives like censorship-resistance demand the existence of multiple diverse paths between two…
Expand
2012
2012
Survivable inter-domain routing with Suurballe-based intra-domain disjointness information in multi-domain optical networks
Chengyi Gao
,
H. Cankaya
,
J. Jue
OFC/NFOEC
2012
Corpus ID: 26693974
We propose an algorithm to find a pair of disjoint inter-domain paths with minimum total cost based on a matrix for each domain…
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