附加到ETS算法，以提高其在特殊情况下的效率，如冠图

2011 International Conference on Computational Intelligence and Communication Networks Pub Date : 2011-10-07 DOI:10.1109/CICN.2011.22

P. Jain, S. Mathur, P. Bhatt

{"title":"附加到ETS算法，以提高其在特殊情况下的效率，如冠图","authors":"P. Jain, S. Mathur, P. Bhatt","doi":"10.1109/CICN.2011.22","DOIUrl":null,"url":null,"abstract":"The ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the \"sequencing\" algorithm.","PeriodicalId":292190,"journal":{"name":"2011 International Conference on Computational Intelligence and Communication Networks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Add-On to the ETS Algorithm to Improve Its Efficiency in Special Cases Such as a Crown Graph\",\"authors\":\"P. Jain, S. Mathur, P. Bhatt\",\"doi\":\"10.1109/CICN.2011.22\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the \\\"sequencing\\\" algorithm.\",\"PeriodicalId\":292190,\"journal\":{\"name\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Computational Intelligence and Communication Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CICN.2011.22\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Computational Intelligence and Communication Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICN.2011.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

边缘表扫描(Edge Table Scanning, ETS)算法用于图的着色问题，几乎可以用最小的颜色数对任何图进行着色，但它仍然有局限性。本文阐述了这一局限性，并介绍了解决这一局限性的方法。我们将这种方法称为“排序”算法。

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

查看原文本刊更多论文

Add-On to the ETS Algorithm to Improve Its Efficiency in Special Cases Such as a Crown Graph

The ETS (Edge Table Scanning) algorithm for graph coloring problem colors almost any graph with minimum number of colors, but still, it has a limitation. This paper explains that limitation and also introduces an approach to resolve the limitation. We here-after call that approach as the "sequencing" algorithm.

求助全文

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

来源期刊

2011 International Conference on Computational Intelligence and Communication Networks

自引率

0.00%

发文量