3-Coloring a Random 3-Colorable Graph
In this problem, we are given a random 3-colorable graph G(3n, p, 3) generated on a graph with 3n vertices, and we wish to produce a 3-coloring of the graph.
Parameters
- : number of vertices
- : number of edges
Insufficient data to display graph
Filters
Computational Model
Randomization
Approximation
Algorithms Table
Insuffient Data to display table
Reductions Table
Insuffient Data to display table
Other relevant algorithms
Displaying 1 of 1 other relevant algorithms