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.
In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. A perfect matching (a.k.a. 1-factor) is a matching which matches all vertices of the graph. That is, every vertex of the graph is incident to exactly one edge of the matching.
Click within the black border of the rectangle to create a node. Click two nodes (it gets yellow when clicked) to create an edge between the two. Create a graph and then go press the button "Perfect Matching" to see if the Perfect Matching exist.
A simple determinant method was implemented in the initial version of the task to get the Tutte Matrix and the program works better with complete graphs. A complete graph is a graph in which every edge is adjacent to every other edge of the graph.
- A better determinant method can be implemented to remove the complete graph restriction.