Data structures and network algorithms
Data structures and network algorithms
Scaling algorithms for network problems
Journal of Computer and System Sciences
Constructing a perfect matching is in random NC
Combinatorica
Solving minimum-cost flow problems by successive approximation
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Matching is as easy as matrix inversion
Combinatorica
An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs
Information Processing Letters
An O(n2 log n) parallel max-flow algorithm
Journal of Algorithms
Forests, frames, and games: algorithms for matroid sums and applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
A new class of heuristic algorithms for weighted perfect matching
Journal of the ACM (JACM)
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Forests, frames, and games: algorithms for matroid sums and applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Expanding graphs and the average-case analysis of algorithms for matchings and related problems
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pad placement and ring routing for custom chip layout
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Fast parallel matching in expander graphs
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Average-case analysis of algorithms for matchings and related problems
Journal of the ACM (JACM)
The effect of post-layout pin permutation on timing
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
On the scalability and dynamic load-balancing of optimistic gate level simulation
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Multi-State Q-Learning Approach for the Dynamic Load Balancing of Time Warp
PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation
Efficient algorithms for maximum weight matchings in general graphs with small edge weights
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Fast algorithms for weighted bipartite matching
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
The k-allocation problem and its variants
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Parallel algorithms for the assignment and minimum-cost flow problems
Operations Research Letters
| Hi-index | 0.02 |
We present algorithms for matching and related problems that run on an EREW PRAM with p processors. Given is a bipartite graph G with n vertices, m edges, and integral edge costs at most N in magnitude. We give an algorithm for the assignment problem (minimum cost perfect bipartite matching) that runs in &Ogr;(√nm log (nN)(log(2p))/p) time and &Ogr;(m) space, for p ≤ m/(√nlog2n). For p = 1 this improves the best known sequential algorithm, and is within a factor of log (nN) of the best known bound for the problem without costs (maximum cardinality matching). For p 1 the time is within a factor of log p of optimum speed-up. Extensions include an algorithm for maximum cardinality bipartite matching with slightly better processor bounds, and similar results for bipartite degree-constrained subgraph problems (with and without costs). Our ideas also extend to general graph matching problems.