Sublinear-Time Parallel Algorithms for Matching and Related Problems
From MaRDI portal
Publication:4033764
DOI10.1006/jagm.1993.1009zbMath0769.68034MaRDI QIDQ4033764
Andrew V. Goldberg, Pravin M. Vaidya, Serge A. Plotkin
Publication date: 16 May 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1993.1009
depth-first search; bipartite matching; minimum-cost flow; flows in zero-one networks; maximal node-disjoint paths; sublinear-time deterministic parallel algorithms
Related Items
Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases, Approximate labelled subtree homeomorphism, An efficient parallel graph edge matching algorithm and its applications, An efficient cost scaling algorithm for the assignment problem, Algorithms and codes for dense assignment problems: The state of the art