Perfect Matchings of a Complete Graph

Version 1.3.0.0 (134 KB) by Daniel R. Herber
Recursive algorithm for the (N-1)!! perfect matchings of Kn and incomplete listings for large N
4.0
(3)
473 Downloads
Updated 18 Nov 2016
View License on GitHub

Cite As

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

MATLAB Release Compatibility
Created with R2015a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers
Tags Add Tags
Acknowledgements

Inspired: PM Architectures Project

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.