Bounds on multiprocessing anomalies and related packing algorithms
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Establishing lower bounds on algorithms: a survey
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
An O(n log n) algorithm for a load balancing problem on paths
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
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
Optimal and distributed algorithms for coverage hole healing in hybrid sensor networks
International Journal of Sensor Networks
On optimal worst-case matching
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
A novel bipartite graph approach for selection and prioritisation of test cases
ACM SIGSOFT Software Engineering Notes
| Hi-index | 0.00 |
The present paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to (m+n) n.