This codebase is meant to store various algorithms to assist in the Network Reliability project, which originally came about from a Summer REU project. Using SageMaths Graph data structure, this code try's to generate information about the minimum number of vertex/edge removals that are required to get a given graph under a specific chromatic number/index. When doing so over large or many graphs this becomes a computationally intense task, thus attention has been given to take advantage of pre-computation and multi-threading.
See MinMax2Demo.ipynb for a breakdown of the functions written in the MinMax2 Module.
Created by: Rodrigo Rios, 2021