Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
We introduce the Constrained Least-cost Tour (CLT) problem: given an undirected graph with weight and cost functions on the edges… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2018
2018
Resilience as well as other objectives like censorship-resistance demand the existence of multiple diverse paths between two… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?
2017
2017
We address the problem of survivable path pair routing in multi- domain optical networks with geographically correlated failures… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2017
2017
Network Function Virtualization (NFV) and Software-Defined Networking (SDN) technologies enable a fast way of deploying network… Expand
  • figure 1
  • figure 2
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… Expand
  • 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… Expand
Is this relevant?