https://github.com/anders-wind/graph_mapper
Mapping out all small sized graphs, problems and their solutions
https://github.com/anders-wind/graph_mapper
Last synced: over 1 year ago
JSON representation
Mapping out all small sized graphs, problems and their solutions
- Host: GitHub
- URL: https://github.com/anders-wind/graph_mapper
- Owner: anders-wind
- License: mit
- Created: 2024-05-12T22:34:18.000Z (about 2 years ago)
- Default Branch: main
- Last Pushed: 2024-06-02T20:50:11.000Z (about 2 years ago)
- Last Synced: 2025-01-23T07:45:14.531Z (over 1 year ago)
- Language: C++
- Homepage:
- Size: 90.8 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
# graph_mapper
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.
## Problems
- [x] minimum vertext cover
- [x] maximum independent set
- [x] maximum clique
- [ ] clique cover
- [ ] k-coloring (minimum)
- [ ] longest path (and hamiltonian path)
- [ ] longest cycle (and hamiltonian cycle)
- [ ] Feedback node set