Leveraging Recursive Gumbel-Max Trick for Approximate Inference in Combinatorial Spaces, NeurIPS 2021

Various code related to the problem of cycle (circuit) double covers

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.

Solved tasks of "Randomized Algorithms" university course, contains implementations of main randomized algorithms.

An application to demonstrate an algorithm for finding maximum matchings in bipartite graphs.

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.

Design a linear-time algorithm to check tree perfect matching

The problem of partitioning a graph into "perfect" pairings.