Parallel complexity of geometric bipartite matching
From MaRDI portal
Cites work
- A deterministic almost-linear time algorithm for minimum-cost flow
- A divide-and-conquer algorithm for min-cost perfect matching in the plane
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- A sub-quadratic algorithm for bipartite matching of planar points with bounded integer coordinates
- Algorithms for the transportation problem in geometric settings
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Bipartite matching in nearly-linear time on moderately dense graphs
- Bipartite perfect matching is in quasi-NC
- Deterministic, near-linear 𝜀 -approximation algorithm for geometric bipartite matching
- Deterministically isolating a perfect matching in bipartite planar graphs
- Finding the smallest gap between sums of square roots
- Green's theorem and isolation in planar graphs
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1305475 (Why is no real title available?)
- Matching and multidimensional matching in chordal and strongly chordal graphs
- Navigating central path with electrical flows: from flows to matchings, and back
- ON THE LINEAR INDEPENDENCE OF ROOTS
- Paths, Trees, and Flowers
- Planar graph perfect matching is in NC
- The matching problem in general graphs is in quasi-NC
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
This page was built for publication: Parallel complexity of geometric bipartite matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7263570)
