Pages that link to "Item:Q1342094"
From MaRDI portal
The following pages link to Finding maximum matching for bipartite graphs in parallel (Q1342094):
Displaying 8 items.
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model (Q582123) (← links)
- Parallel algorithms for bipartite matching problems on distributed memory computers (Q712711) (← links)
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274) (← links)
- An adjustable linear time parallel algorithm for maximum weight bipartite matching (Q1045931) (← links)
- An optimal parallel algorithm for general maximal matchings is as easy as for bipartite graphs (Q1607053) (← links)
- Computing asymmetric median tree of two trees via better bipartite matching algorithm (Q1642720) (← links)
- Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems (Q3990106) (← links)