Distributed algorithms for computing shortest pairs of disjoint paths

DOI10.1109/18.212275zbMath0778.68038OpenAlexW2102722785MaRDI QIDQ4202064

Richard G. Ogier, Vlad Rutenburg, Nachum Shacham

Publication date: 13 January 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.212275

zbMATH Keywords

shortest pathdisjoint paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (9)

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks ⋮ Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Towards Single Face Shortest Vertex-Disjoint Paths in Undirected Planar Graphs ⋮ Path Problems in Complex Networks ⋮ A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks ⋮ On shortest disjoint paths in planar graphs ⋮ Walking through waypoints ⋮ The Directed Disjoint Shortest Paths Problem ⋮ Safe and stabilizing distributed multi-path cellular flows

This page was built for publication: Distributed algorithms for computing shortest pairs of disjoint paths