Finding maximum matching for bipartite graphs in parallel
From MaRDI portal
Publication:1342094
DOI10.1016/0167-6377(94)90021-3zbMath0813.90120MaRDI QIDQ1342094
Publication date: 11 January 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)90021-3
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
65Y05: Parallel numerical computation
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
- Fast parallel graph searching with applications
- Parallel computation and conflicts in memory access
- TWO THEOREMS IN GRAPH THEORY
- Parallel Matrix and Graph Algorithms
- An O(n2log n) parallel max-flow algorithm
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs