平面图的无冲突顶点着色

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal Pub Date : 2017-07-10 DOI:10.61366/2576-2176.1049

Shaun A. Seymour

{"title":"平面图的无冲突顶点着色","authors":"Shaun A. Seymour","doi":"10.61366/2576-2176.1049","DOIUrl":null,"url":null,"abstract":"The conflict-free coloring problem is a variation of the vertex coloring problem, a classical NP-hard optimization problem. The conflict-free coloring problem aims to color a possibly proper subset of vertices such that there is a unique color within the closed neighborhood (a vertex and its neighbors) of every vertex. This paper presents recent findings and heuristics to solve the conflict-free coloring problem on both general graphs and planar graphs.","PeriodicalId":113813,"journal":{"name":"Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Conflict-Free Vertex Coloring Of Planar Graphs\",\"authors\":\"Shaun A. Seymour\",\"doi\":\"10.61366/2576-2176.1049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The conflict-free coloring problem is a variation of the vertex coloring problem, a classical NP-hard optimization problem. The conflict-free coloring problem aims to color a possibly proper subset of vertices such that there is a unique color within the closed neighborhood (a vertex and its neighbors) of every vertex. This paper presents recent findings and heuristics to solve the conflict-free coloring problem on both general graphs and planar graphs.\",\"PeriodicalId\":113813,\"journal\":{\"name\":\"Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.61366/2576-2176.1049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.61366/2576-2176.1049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

无冲突着色问题是顶点着色问题的一种变体，是经典的NP-hard优化问题。无冲突着色问题的目的是为可能适当的顶点子集着色，使每个顶点的封闭邻域(顶点及其邻居)中都有唯一的颜色。本文介绍了解决一般图和平面图的无冲突着色问题的最新发现和启发。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Conflict-Free Vertex Coloring Of Planar Graphs

The conflict-free coloring problem is a variation of the vertex coloring problem, a classical NP-hard optimization problem. The conflict-free coloring problem aims to color a possibly proper subset of vertices such that there is a unique color within the closed neighborhood (a vertex and its neighbors) of every vertex. This paper presents recent findings and heuristics to solve the conflict-free coloring problem on both general graphs and planar graphs.

求助全文

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

来源期刊

Scholarly Horizons: University of Minnesota, Morris Undergraduate Journal

自引率

0.00%

发文量

期刊最新文献

Organizational Communication in the WNBA What Influences Reproductive Rights Policy? State Abortion Restrictions and the Level of State Democracy Point Deductions in World Football: The Issue of Financial Fair Play Music Genre Classification Capabilities of Enhanced Neural Network Architectures MLCP of Red Bull