A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks

DOI10.1142/S0129054117500253zbMath1372.68029MaRDI QIDQ5357510

Vincent Villain, Mehmet Hakan Karaata, Rachid Hadid

Publication date: 8 September 2017

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

stabilizationdistributed systemsfault-toleranceall node-disjoint pathstwo node-disjoint paths

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

A self-stabilizing algorithm for constructing a minimal reachable directed acyclic graph with two senders and two targets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Building self-stabilizing overlay networks with the transitive closure framework
• Global wire routing in two-dimensional arrays
• A self-stabilizing algorithm for constructing spanning trees
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• A quick method for finding shortest pairs of disjoint paths
• Disjoint paths in a network
• Self-stabilizing systems in spite of distributed control
• Distributed algorithms for computing shortest pairs of disjoint paths
• Daemon Conversions in Distributed Self-stabilizing Algorithms
• An Inherently Stabilizing Algorithm for Node-To-Node Routing over All Shortest Node-Disjoint Paths in Hypercube Networks
• Principles of Distributed Systems

This page was built for publication: A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks