Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

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)

Isabel M. Beichl, F Sullivan

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

Keywords

backtrack algorithms, combinatorial problems, graph traversal, matchings

Citation

Beichl, I. and Sullivan, F. (1997), Make Me a Match, IEEE Computing in Science and Engineering (Accessed October 18, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created October 1, 1997, Updated February 17, 2017
Was this page helpful?