Affiliation:
1. Department of Computer Science, University of Colorado, Boulder, CO
Abstract
A matching on a graph is a set of edges, no two of which share a vertex. A maximum matching contains the greatest number of edges possible. This paper presents an efficient implementation of Edmonds' algorithm for finding a maximum matching. The computation time is proportional to
V
3
, where
V
is the number of vertices; previous implementations of Edmonds' algorithm have computation time proportional to
V
4
. The implementation is based on a system of labels that encodes the structure of alternating paths.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference11 articles.
1. Optimal scheduling for two-processor systems;COFFMAN E J;Acta Informatica,1972
2. Paths, trees and flowers;EDMONDS;Canad J. Math.,1965
3. Maximum matching and a polyhedron with 0,1-vertices;ED~OSDS J;J. Res. Nat. Bur Standards,1965
Cited by
231 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献