Scribd
Upload
42 views1 page

Understanding Decision Problems in Graphs

A decision problem involves answering a Yes/No question regarding the existence of a solution under specified conditions. The goal is to determine if these conditions can be satisfied. An example is the graph coloring problem, where one must decide if a graph can be colored with a certain number of colors without adjacent vertices sharing the same color.

Uploaded by

dhansanushree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
42 views1 page

Understanding Decision Problems in Graphs

A decision problem involves answering a Yes/No question regarding the existence of a solution under specified conditions. The goal is to determine if these conditions can be satisfied. An example is the graph coloring problem, where one must decide if a graph can be colored with a certain number of colors without adjacent vertices sharing the same color.

Uploaded by

dhansanushree
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd

1.

Decision Problem
🔹 Definition:
A decision problem asks a Yes/No question about whether a solution exists under
certain conditions.

🔹 Goal:
To decide if it's possible to meet the conditions.

🔹 Example (Graph Coloring):


"Can this graph be colored using 3 colors so that no two adjacent vertices have the
same color?"

You just need to answer: Yes or No

No need to give the actual coloring

You might also like