In theoretical computer science and network routing, Suurballe's algorithm is an algorithm for finding two disjoint paths in a nonnegatively-weightedâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Carlos Galdamez, Zilong Ye
- 2017 26th Wireless and Optical Communicationâ€¦
- 2017

Network Function Virtualization (NFV) and Software-Defined Networking (SDN) technologies enable a fast way of deploying networkâ€¦Â (More)

Is this relevant?

2015

2015

- AndrÃ© V. S. Xavier, Raul Camelo de Andrade Almeida, Daniel A. R. Chaves, Carmelo J. A. Bastos Filho, Joaquim F. Martins-Filho
- Photonic Network Communications
- 2015

WDM optical networks allow the transmission of multiple services with high rates and low cost. Therefore, the occurrence of aâ€¦Â (More)

Is this relevant?

2012

2012

- Chengyi Gao, H. C. Cankaya, J. P. Jue
- OFC/NFOEC
- 2012

We propose an algorithm to find a pair of disjoint inter-domain paths with minimum total cost based on a matrix for each domainâ€¦Â (More)

Is this relevant?

2004

2004

- Ajay Kumar Todimala, B. Ramamurthy
- Proceedings. 13th International Conference onâ€¦
- 2004

Survivable routing of a connection involves computation of a pair of diverse routes such that at most one route fails whenâ€¦Â (More)

Is this relevant?

Highly Cited

1984

Highly Cited

1984

- J. W. Suurballe, Robert E. Tarjan
- Networks
- 1984

Let G be a directed graph containing n vertices, one of which is a distinguished source s, and m edges, each with a non-negativeâ€¦Â (More)

Is this relevant?