This is the graph_mapper project. The intend is to solve different problems on all graphs up to a limited size (most likely N=9) and store their dataset.
See data/ folder for the currently existing results.
- minimum vertext cover
- maximum independent set
- maximum clique
- clique cover
- k-coloring (minimum)
- longest path (and hamiltonian path)
- longest cycle (and hamiltonian cycle)
- Feedback node set