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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1984-2017
0119842017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Network Function Virtualization (NFV) and Software-Defined Networking (SDN) technologies enable a fast way of deploying network… (More)
  • figure 1
  • figure 2
Is this relevant?
2015
2015
WDM optical networks allow the transmission of multiple services with high rates and low cost. Therefore, the occurrence of a… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
2012
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)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Survivable routing of a connection involves computation of a pair of diverse routes such that at most one route fails when… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
1984
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?