Related references
Note: Only part of the references are listed.Solving the edge-disjoint paths problem using a two-stage method
Bernardo Martin et al.
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH (2020)
One-Shot Multiple Disjoint Path Discovery Protocol (1S-MDP)
Diego Lopez-Pajares et al.
IEEE COMMUNICATIONS LETTERS (2020)
Scalable and Efficient Multipath Routing via Redundant Trees
Janos Tapolcai et al.
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS (2019)
The undirected two disjoint shortest paths problem
Marinus Gottschau et al.
OPERATIONS RESEARCH LETTERS (2019)
SHORTEST TWO DISJOINT PATHS IN POLYNOMIAL TIME
Andreas Bjorklun et al.
SIAM JOURNAL ON COMPUTING (2019)
A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks
Rachid Hadid et al.
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE (2017)
k-Maximally Disjoint Path Routing Algorithms for SDN
John Olorunfemi Abe et al.
2015 INTERNATIONAL CONFERENCE ON CYBER-ENABLED DISTRIBUTED COMPUTING AND KNOWLEDGE DISCOVERY (2015)
The disjoint paths problem in quadratic time
Ken-ichi Kawarabayashi et al.
JOURNAL OF COMBINATORIAL THEORY SERIES B (2012)
A method for evacuation route planning in disaster situations
Vania Campos et al.
PROCEEDINGS OF EWGT 2012 - 15TH MEETING OF THE EURO WORKING GROUP ON TRANSPORTATION (2012)
Share Paper
