Thumbnail
Access Restriction
Subscribed

Author Gabow, Harold N.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1976
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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 $\textit{V}3,$ where $\textit{V}$ is the number of vertices; previous implementations of Edmonds' algorithm have computation time proportional to $\textit{V}4.$ The implementation is based on a system of labels that encodes the structure of alternating paths.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1976-04-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 23
Issue Number 2
Page Count 14
Starting Page 221
Ending Page 234


Open content in new tab

   Open content in new tab
Source: ACM Digital Library