1983 Reports
Efficient Algorithms for Finding Maximal Matching in Graphs
This paper surveys the techniques used for designing the most efficient algorithms for finding a maximum cardinality or weighted matching in (general or bipartite) graphs. It also lists some open problems concerning possible improvements in existing algorithms and the existence of fast parallel algorithms for these problems.
Subjects
Files
-
cucs-048-83.pdf application/pdf 990 KB Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-048-83
- Published Here
- October 20, 2011