Sublinear-Time Parallel Algorithms for Matching and Related Problems
From MaRDI portal
Publication:4033764
DOI10.1006/JAGM.1993.1009zbMATH Open0769.68034OpenAlexW2064306958MaRDI QIDQ4033764FDOQ4033764
Andrew V. Goldberg, Serge Plotkin, Pravin M. Vaidya
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
Recommendations
- An optimal parallel algorithm for maximal matching
- A fast and simple randomized parallel algorithm for maximal matching
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
- Faster scaling algorithms for general graph matching problems
- scientific article; zbMATH DE number 1003296
depth-first searchbipartite matchingminimum-cost flowflows in zero-one networksmaximal node-disjoint pathssublinear-time deterministic parallel algorithms
Cited In (17)
- Subquadratic algorithms for succinct stable matching
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations
- Fast Interior Point Methods for Bipartite Matching
- Title not available (Why is that?)
- Sublinear Algorithms for Parameterized Matching
- Sharp threshold for embedding balanced spanning trees in random geometric graphs
- A faster parameterized algorithm for temporal matching
- An efficient parallel graph edge matching algorithm and its applications
- An efficient cost scaling algorithm for the assignment problem
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
- Implicit computation of maximum bipartite matchings by sublinear functional operations
- On efficient implicit OBDD-based algorithms for maximal matchings
- Approximate labelled subtree homeomorphism
- (1- ϵ )-Approximate Maximum Weighted Matching in poly(1/ ϵ , log n ) Time in the Distributed and Parallel Settings
- An adjustable linear time parallel algorithm for maximum weight bipartite matching
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
- Algorithms and codes for dense assignment problems: The state of the art
This page was built for publication: Sublinear-Time Parallel Algorithms for Matching and Related Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033764)
