Question: Let G be a graph with ‘n’ nodes and let ‘m’ be the chromatic number of the graph.
Then the time taken by the backtracking algorithm to color it is
Answer:
MCQ: Let G be a graph with ‘n’ nodes and let ‘m’ be the chromatic number of the graph.
Then the time taken by the backtracking algorithm to color it is