邻域平衡着色的 NP 完备性

arXiv - CS - Computational Complexity Pub Date : 2024-07-29 DOI:arxiv-2407.19793

Saeed Asaeedi

{"title":"邻域平衡着色的 NP 完备性","authors":"Saeed Asaeedi","doi":"arxiv-2407.19793","DOIUrl":null,"url":null,"abstract":"A Neighborhood Balanced Coloring (NBC) of a graph is a red-blue coloring\nwhere each vertex has the same number of red and blue neighbors. This work\nproves that determining if a graph admits an NBC is NP-complete. We present a\ngenetic algorithm to solve this problem, which we implemented and compared\nagainst exact and randomized algorithms.","PeriodicalId":501024,"journal":{"name":"arXiv - CS - Computational Complexity","volume":"212 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"NP-Completeness of Neighborhood Balanced Colorings\",\"authors\":\"Saeed Asaeedi\",\"doi\":\"arxiv-2407.19793\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A Neighborhood Balanced Coloring (NBC) of a graph is a red-blue coloring\\nwhere each vertex has the same number of red and blue neighbors. This work\\nproves that determining if a graph admits an NBC is NP-complete. We present a\\ngenetic algorithm to solve this problem, which we implemented and compared\\nagainst exact and randomized algorithms.\",\"PeriodicalId\":501024,\"journal\":{\"name\":\"arXiv - CS - Computational Complexity\",\"volume\":\"212 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2407.19793\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2407.19793","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

图的邻域平衡着色（NBC）是一种红蓝着色，其中每个顶点都有相同数量的红色和蓝色邻域。这项工作证明，确定一个图是否允许 NBC 是 NP-完全的。我们提出了解决这一问题的遗传算法，并将其与精确算法和随机算法进行了比较。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

NP-Completeness of Neighborhood Balanced Colorings

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

arXiv - CS - Computational Complexity

自引率

0.00%

发文量