https://github.com/Lastaapps/bc_thesis_code
https://github.com/Lastaapps/bc_thesis_code
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/Lastaapps/bc_thesis_code
- Owner: Lastaapps
- License: mit
- Created: 2025-02-14T12:16:55.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2025-02-14T12:36:54.000Z (over 1 year ago)
- Last Synced: 2025-02-14T13:35:10.328Z (over 1 year ago)
- Language: Mathematica
- Homepage:
- Size: 21.5 MB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Flexible realizations existence: NP-completeness on sparse graphs and algorithms
*Petr Laštovička and Jan Legerský*
In this repository we provide our code for the NAC-coloring search algorithm
described in the paper. We also provide a notebook `NAC_playground.ipynb` where
you can experiment with the algorithm and `NAC_presentation.ipynb`
in which you can see how we run and analyze our benchmarks. You can also run them yourself.
The interface of our code is also described in the notebooks, mainly in `NAC_presentation.ipynb`.
## Setup
Python 3.12 is required.
```bash
pip -m venv .venv
source .venv/bin/activate
pip install -r requirements.txt
```
## Tests
You can run tests by executing `pytest`.
The packages also contains base for Cartesian NAC-coloring search,
the related tests are skipped for now as it is not yet fully implemented
for every approach.
## Structure
- `nac` - the code of our NAC implementation
- `benchmarks` - Core related to benchmarks - graphs loading, generation, notebook utility functions
- `benchmarks/precomputed` - Results of the benchmarks as run on our hardware
- `graphs_store` - stores generated graphs of selected classes