Name
Abstract | ||
|---|---|---|
In this paper, we present an algorithm to approximate the chromatic number of a graph. Our proposal is based on the construction of maximal independent set. We experimentally show that our proposal improves the average degree approximation proposed by De Ita et. al. [10]. Finally, our proposal is compared against JGraphT and Sage which contain a model for computing the chromatic number of a graph. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/CONIELECOMP.2015.7086935 | CONIELECOMP |
Field | DocType | ISSN |
Discrete mathematics,Combinatorics,Algorithm,Foster graph,Independent set,Friendship graph,Butterfly graph,Windmill graph,Moser spindle,Mathematics,Graph coloring,Maximal independent set | Conference | 2474-9036 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Angelica Guzman Ponce | 1 | 0 | 0.34 |
| José Raymundo Marcial-Romero | 2 | 5 | 12.87 |
| Jose A. Henrandez | 3 | 0 | 0.34 |
| Guillermo De Ita Luna | 4 | 29 | 16.57 |