Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.19793 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916338739445760 |
|---|---|
| author | Asaeedi, Saeed |
| author_facet | Asaeedi, Saeed |
| contents | A Neighborhood Balanced Coloring (NBC) of a graph is a red-blue coloring where each vertex has the same number of red and blue neighbors. This work proves that determining if a graph admits an NBC is NP-complete. We present a genetic algorithm to solve this problem, which we implemented and compared against exact and randomized algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_19793 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | NP-Completeness of Neighborhood Balanced Colorings Asaeedi, Saeed Computational Complexity A Neighborhood Balanced Coloring (NBC) of a graph is a red-blue coloring where each vertex has the same number of red and blue neighbors. This work proves that determining if a graph admits an NBC is NP-complete. We present a genetic algorithm to solve this problem, which we implemented and compared against exact and randomized algorithms. |
| title | NP-Completeness of Neighborhood Balanced Colorings |
| topic | Computational Complexity |
| url | https://arxiv.org/abs/2407.19793 |