Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,617,152 papers from all fields of science
Search
Sign In
Create Free Account
Edge disjoint shortest pair algorithm
Edge disjoint shortest pair algorithm is an algorithm in computer network routing. The algorithm is used for generating the shortest pair of edge…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
Algorithm
Dijkstra's algorithm
Optical mesh network
Routing
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Retraction Notice: A New Algorithm for the Shortest Path of Touring Disjoint ConvexPolygons
W. Lijuan
,
Jiang Bo
,
Deng Ansheng
,
Wei Qi
2016
Corpus ID: 61767593
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