Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs

DOI10.1137/0220022zbMath0722.68066OpenAlexW2148691049MaRDI QIDQ3210185

Samir Khuller, Baruch Schieber

Publication date: 1991

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0220022

zbMATH Keywords

parallel algorithmdisjoint paths

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Connectivity (05C40)

Related Items (4)

OFDP: a distributed algorithm for finding disjoint paths with minimum total length in wireless sensor networks ⋮ A faster parallel algorithm for \(k\)-connectivity ⋮ Walking through waypoints ⋮ Flow in planar graphs with vertex capacities

This page was built for publication: Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs