1. Let G be a color graph where each node has a color and multiple nodes can share the same color. In particular, there is a designated initial node. An ω-path is an infinite walk on G that starts from the initial.

(1). Design an algorithm that decides where there is an ω-path on which P(yellow ∨ Qblue) holds.

(2). Design an algorithm that decides where there is an ω-path on which PQ(yellow ∨ Qblue) holds.

Answer rating: 100% (QA)

There is no efficient algorithm available for coloring a graph with minimum number of colours as the problem is a known NP Complete problem There are ... View the full answer