Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

UOFG_Algorithmics_1 > Lecture 6 - Graph Colouring Problem > Flashcards

Lecture 6 - Graph Colouring Problem Flashcards

1
Q

Abbreviation?

A

GCP

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

What is an instance of GCP?

A

a graph G and target integer K

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

What is the question of GCP?

A

can one of the K colours be attatched to each vertex f G so that adjacent vertices always have different colours

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Is this problem Np-Complete?

A

YES

How well did you know this?
1
Not at all
2
3
4
5
Perfectly

UOFG_Algorithmics_1 (43 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions