Chromatic Number: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{DISPLAYTITLE:Chromatic Number (Graph Coloring)}} == Description == In this case, we wish to compute the chromatic number of a graph; that is, the smallest number of colors needed to color the graph. == Related Problems == Related: k-Graph Coloring, 2-Graph Coloring, 3-Graph Coloring, 4-Graph Coloring, 5-Graph Coloring, #k-Graph Coloring, #2-Graph Coloring, #3-Graph Coloring, #4-Graph Coloring, #5-Graph Coloring == Parameter...") |
No edit summary |
||
| Line 10: | Line 10: | ||
== Parameters == | == Parameters == | ||
n: number of vertices | |||
m: number of edges | |||
m: number of edges | |||
== Table of Algorithms == | == Table of Algorithms == | ||
Revision as of 12:03, 15 February 2023
Description
In this case, we wish to compute the chromatic number of a graph; that is, the smallest number of colors needed to color the graph.
Related Problems
Related: k-Graph Coloring, 2-Graph Coloring, 3-Graph Coloring, 4-Graph Coloring, 5-Graph Coloring, #k-Graph Coloring, #2-Graph Coloring, #3-Graph Coloring, #4-Graph Coloring, #5-Graph Coloring
Parameters
n: number of vertices
m: number of edges
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Karger, Blum | 1997 | $O(poly(V))$ | $\tilde{O}(n^{3/14})$ | Deterministic | Time |
References/Citation
https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=4031392