A Note on Eswaran and Tarjan’s Algorithm for the Strong Connectivity Augmentation Problem

2006 ◽  
pp. 19-26 ◽  
Author(s):  
S. Raghavan
Keyword(s):  
Strong Connectivity ◽  
Connectivity Augmentation ◽  
Tarjan’S Algorithm ◽  
Tarjan's Algorithm

scholarly journals Strong Connectivity Augmentation is FPT

2021 ◽  
pp. 219-234
Author(s):  
Kristine Vitting Klinkby ◽  
Pranabendu Misra ◽  
Saket Saurabh
Keyword(s):  
Strong Connectivity ◽  
Connectivity Augmentation

scholarly journals More efficient on-the-fly LTL verification with Tarjan's algorithm

2005 ◽  
Vol 345 (1) ◽  
pp. 60-82 ◽  
Author(s):  
Jaco Geldenhuys ◽  
Antti Valmari
Keyword(s):  
Tarjan’S Algorithm ◽  
Tarjan's Algorithm

scholarly journals Exploiting the diversity of shortest pairs of edge-disjoint paths

2018 ◽  
Author(s):  
Marina Girolimetto ◽  
Rodrigo S. Tessinari ◽  
Fabio O. Lima ◽  
Claunir Pavan ◽  
Marcia H. M. Paiva
Keyword(s):  
Network Topology ◽  
Optical Network ◽  
Optical Telecommunication ◽  
Telecommunication Networks ◽  
Disjoint Paths ◽  
Node Pair ◽  
Edge Disjoint ◽  
Backup Paths ◽  
Tarjan’S Algorithm ◽  
Tarjan's Algorithm

In an optical network, given a pair of source and destination nodes, some algorithm can be used to find shortest pairs of edge-disjoint paths to be used as working and backup paths. The Suurballe and Tarjan's algorithm is a solution, but it can found different shortest pairs of pathways interconnecting the same pair of source and destination nodes. In this paper, two versions of the Suurballe and Tarjan's algorithm is proposed to deal with that diversity. For each node pair of a given network topology, these versions find the most balanced shortest pair of working and backup paths and the least balanced one. Both algorithms are tested and analyzed in a set of 40 2-edge-connected topologies of real-world optical telecommunication networks. A difference of up to 29% was found between the two strategies.

scholarly journals Structured Connectivity Augmentation

2018 ◽  
Vol 32 (4) ◽  
pp. 2612-2635
Author(s):  
Fedor V. Fomin ◽  
Petr A. Golovach ◽  
Dimitrios M. Thilikos
Keyword(s):  
Connectivity Augmentation
Sign in / Sign up

Export Citation Format

Share Document