Week 4 Flashcards

1
Q

What is an edge-weighed graph?

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

What is the Chinese Postman Problem?

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

What is the algorithm for the Chinese Postman Problem?

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

What is the definition of a Hamilton cycle?

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

What is the brute-force algorithm to check for a Hamiltonian cycle?

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

What is a theorem about the Hamiltonian cycle?

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

What is Diracs’ theorem?

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

What is Posa’s algorithm?

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

What is the Travelling Salesman Problem?

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

How do we deal with Hamiltonian cycles in a directed graph?

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