Pages that link to "Item:Q4033764"
From MaRDI portal
The following pages link to Sublinear-Time Parallel Algorithms for Matching and Related Problems (Q4033764):
Displaying 15 items.
- On efficient implicit OBDD-based algorithms for maximal matchings (Q476163) (← links)
- Implicit computation of maximum bipartite matchings by sublinear functional operations (Q477185) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931) (← links)
- An efficient parallel graph edge matching algorithm and its applications (Q1288436) (← links)
- An efficient cost scaling algorithm for the assignment problem (Q1914072) (← links)
- Algorithms and codes for dense assignment problems: The state of the art (Q1962018) (← links)
- A faster parameterized algorithm for temporal matching (Q2059876) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- Implicit Computation of Maximum Bipartite Matchings by Sublinear Functional Operations (Q2898059) (← links)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (Q3990106) (← links)
- (Q4452099) (← links)
- Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases (Q4508634) (← links)
- Sublinear Algorithms for Parameterized Matching (Q5307519) (← links)
- Sharp threshold for embedding balanced spanning trees in random geometric graphs (Q6595519) (← links)