1
Q
Abbreviation?
A
GCP
2
Q
What is an instance of GCP?
A
a graph G and target integer K
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
4
Q
Is this problem Np-Complete?
A
YES
UOFG_Algorithmics_1
flashcards
Decks in class (43)
# Cards
-
Lecture 1 - Time Complexity Revision16
-
Lecture 1 - ADTs15
-
Lecture 1 - Comparison Sorts13
-
Lecture 1 - Radix Sort11
-
Lecture 1 - Tries5
-
Lecture 2 - Graph Basics16
-
Lecture 2 - Graph Representations5
-
Lecture 2 - BFS and DFS11
-
Lecture 2 - Weighted Graphs3
-
Lecture 2 - Dijkstra's2
-
Lecture 3 - Graph Recap6
-
Lecture 3 - Spanning Trees7
-
Lecture 3 - Prim-Jarnik Algorithm5
-
Lecture 3 - Dijkstra's Refinement3
-
Lecture 3 - Topological Ordering15
-
Lecture 4 - Text Compression Intro8
-
Lecture 4 - Huffman Encoding21
-
Lecture 4 - LZW Compression11
-
Lecture 4 - String Difference23
-
Lecture 5 - String/Pattern Search Intro3
-
Lecture 5 - Brute Force Algorithm4
-
Lecture 5 - KMP20
-
Lecture 5 - BM20
-
Lecture 6 - NP Intro16
-
Lecture 6 - NP-Completeness11
-
Lecture 6 - Hamiltonian Cycle6
-
Lecture 6 - Travelling Salesman Problem3
-
Lecture 6 - Clique Problem5
-
Lecture 6 - Graph Colouring Problem4
-
Lecture 6 - Satisfiability Problem3
-
Lecture 6 - Classes P and NP13
-
Lecture 6 - Polynomial Time Reductions6
-
Lecture 6 - What is NP-Complete? Formally?11
-
Lecture 7 - Computability Intro13
-
Lecture 7 - Halting Problem7
-
Lecture 7 - Models Of Computation5
-
Lecture 7 - DFA28
-
Lecture 8 - Intro5
-
Lecture 8 - Pushdown Automata13
-
Lecture 8 - Turing Machines18
-
Lecture 8 - Turing Machines P and NP2
-
Lecture 8 - Counter Programs3
-
Lecture 8 - Church-Turing Thesis5
