An approach about the NP-Hard problem: Partition Into Perfect Matchings, in which I worked in the class of Complexity and Algorithms, in Universidad del Norte, which I wanted to share with the world.
A short program in the Algorithms and Complexity class, where you can generate a graph with a specific number of nodes and get a perfect matching graph if it exists.
The problem of partitioning a graph into "perfect" pairings.
Add a description, image, and links to the perfect-matchings topic page so that developers can more easily learn about it.
To associate your repository with the perfect-matchings topic, visit your repo's landing page and select "manage topics."