Question: The graph coloring problem is the following: COLORING: Data: adjacency matrix M of an m-vertex undirected graph. Decide: if there exists a vector v
COLORING:
Data: adjacency matrix M of an m-vertex undirected graph.
Decide: if there exists a vector v € {bleu, rouge, vert}msuch that for every edge (a, b) in the graph, v[a] v[b].
a- Sketch a backtracking algorithm colo(M) for Coloring. Hint. Think of what might be a k-promising vector, 0 Sk Sm.
b- Even if no deterministic polynomial time algorithm solving Coloring is known, could you turn your algorithm above into a polynomial time Las Vegas algorithm? (Explain.)
Step by Step Solution
3.48 Rating (158 Votes )
There are 3 Steps involved in it
a Here is a sketch of a backtracking algorithm coloM for the graph coloring problem 1 Initialize an ... View full answer
Get step-by-step solutions from verified subject matter experts
