Skip to content
Log in
Sponsored AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI AI AM CLAUDE, A Beginner's Guide: Learn the basics of working with AI

Author

Thomas P. Hayes

View on Semantic Scholar

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Maximum Matching on Regular Nonbipartite Graphs

It is proved that any blocking flow-type maximum matching algorithm based on finding shortest augmenting paths runs in O(n^2) time on d-regular graphs, both bipartite and nonbipartite, and that the classic matching algorithms automatically outperform [Yus13, DH25].

Varsha Dani, Thomas P. Hayes, Seth Pettie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.