NP-Completeness of Neighborhood Balanced Colorings
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2024
- DOI:
- 10.48550/arXiv.2407.19793
- arXiv:
- arXiv:2407.19793
- Bibcode:
- 2024arXiv240719793A
- Keywords:
-
- Computer Science - Computational Complexity