Perfect Matchings of a Complete Graph

Recursive algorithm for the (N-1)!! perfect matchings of Kn and incomplete listings for large N

https://github.com/danielrherber/perfect-matchings-of-a-complete-graph

Version 1.3.0.0 (134 KB)
475 Downloads
(3)
18 Nov 2016

You are now following this Submission

Cite As

Daniel R. Herber (2026). Perfect Matchings of a Complete Graph (https://github.com/danielrherber/perfect-matchings-of-a-complete-graph), GitHub. Retrieved .

Acknowledgements

Inspired: PM Architectures Project

Categories

Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

General Information

MATLAB Release Compatibility

  • Compatible with any release

Platform Compatibility

  • Windows
  • macOS
  • Linux
Open in new tab

Versions that use the GitHub default branch cannot be downloaded

Version Published Release Notes
1.3.0.0

Title fix.
1.2.0.0

Moved the submission to github.
1.1.0.0

Added InversePerfectMatchings function. Fixed some typos with N!! instead of (N-1)!!
1.0.0.0

Description formating and fixed mistake in image

To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.