Beichl, I.
and Sullivan, F.
(1997),
Make Me a Match, IEEE Computing in Science and Engineering
(Accessed October 5, 2024)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
Make Me a Match
Published
Author(s)
,
Abstract
This is a tutorial article on the Hopcroft-Karp algorithm for finding a maximal matching in an undirected graph.Citation
IEEE Computing in Science and Engineering
Pub Type
Journals
Keywords
backtrack algorithms, combinatorial problems, graph traversal, matchings
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created October 1, 1997, Updated February 17, 2017