Approximate The Chromatic Number Of A Graph Using Maximal Independent Sets

Angelica Guzman-Ponce,J. Raymundo Marcial-Romero,Guillermo De Ita,Jose A. Hernandez

2016 INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND COMPUTERS (CONIELECOMP)（2016）

引用 1|浏览9

暂无评分

摘要

In this paper, we present an algorithm to approximate the chromatic number of a graph. The proposed approach initially removes even cycles and acyclic subgraphs, this process is called debugging, later to colour the remaining graph, we present a strategy to obtain maximal independent sets. We experimentally show that our proposal improves the results compare to JGraphT and Sage which contain a module for computing the chromatic number of a graph.

查看译文

关键词

graph chromatic number approximation,maximal independent sets,even cycles,acyclic subgraphs,debugging process,graph colouring,maximal independent sets,JGraphT,Sage

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要