2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1988)

White Plains, NY, USA

Oct. 24, 1988 to Oct. 26, 1988

ISBN: 0-8186-0877-3

pp: 174-185

A.V. Goldberg , Dept. of Comput. Sci., Stanford Univ., CA, USA

ABSTRACT

The authors present the first sub-linear-time deterministic parallel algorithms for bipartite matching and several related problems, including maximal node-disjoint paths, depth-first search, and flows in zero-one networks. The results are based on a better understanding of the combinatorial structure of the above problems, which lead to new algorithmic techniques. In particular, it is shown how to use maximal matching to extend, in parallel, a current set of node-disjoint paths and how to take advantage of the parallelism that arises when a large number of nodes are active during an execution of a push/relabel network flow algorithm. It is also shown how to apply the techniques to design parallel algorithms for the weighted versions of the above problems.

INDEX TERMS

node-disjoint paths, sublinear-time parallel algorithms, matching, maximal node-disjoint paths, depth-first search, zero-one networks, combinatorial structure

CITATION

P.M. Vaidya,
S.A. Plotkin,
A.V. Goldberg,
"Sublinear-time parallel algorithms for matching and related problems",

*2013 IEEE 54th Annual Symposium on Foundations of Computer Science*, vol. 00, no. , pp. 174-185, 1988, doi:10.1109/SFCS.1988.21935