For each of the following problems: design a greedy algorithm that solves the problem; describe your algorithm with clear pseudo
code; and prove the time efficiency class of your algorithm.
2-coloring input: an undirected graph G (V, E) output: a sequence coloring-((u, c)IE V and ce(1,2) such that each V appears exactly once in colors , and no adjacent vertices are assigned the same color
2-coloring input: an undirected graph G (V, E) output: a sequence coloring-((u, c)IE V and ce(1,2) such that each V appears exactly once in colors , and no adjacent vertices are assigned the same color
1 answer:
You might be interested in