Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia

Related topics

Related topics

9 relations
Dijkstra's algorithmDirected graphEdge disjoint shortest pair algorithmFibonacci heap

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
On the Constrained Least-cost Tour Problem
We introduce the Constrained Least-cost Tour (CLT) problem: given an undirected graph with weight and cost functions on the edges… 
2018
2018
Evaluation of algorithms for multipath route selection over the Internet
Resilience as well as other objectives like censorship-resistance demand the existence of multiple diverse paths between two… 
2017
2017
Survivable Routing in Multi-Domain Optical Networks with Geographically Correlated Failures
We address the problem of survivable path pair routing in multi- domain optical networks with geographically correlated failures… 
2017
2017
Resilient virtual network mapping against large-scale regional failures
Network Function Virtualization (NFV) and Software-Defined Networking (SDN) technologies enable a fast way of deploying network… 
2012
2012
Survivable inter-domain routing with Suurballe-based intra-domain disjointness information in multi-domain optical networks
We propose an algorithm to find a pair of disjoint inter-domain paths with minimum total cost based on a matrix for each domain… 
2004
2004
IMSH: an iterative heuristic for SRLG diverse routing in WDM mesh networks
Survivable routing of a connection involves computation of a pair of diverse routes such that at most one route fails when… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License