Week 4 Flashcards
1
Q
What is an edge-weighed graph?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/809/729/a_image_thumb.png?1650877675)
2
Q
What is the Chinese Postman Problem?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/809/847/a_image_thumb.png?1650877712)
3
Q
What is the algorithm for the Chinese Postman Problem?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/809/876/a_image_thumb.png?1650878520)
4
Q
What is the definition of a Hamilton cycle?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/811/145/a_image_thumb.png?1650878572)
5
Q
What is the brute-force algorithm to check for a Hamiltonian cycle?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/811/228/a_image_thumb.png?1650878609)
6
Q
What is a theorem about the Hamiltonian cycle?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/811/258/a_image_thumb.png?1650878695)
7
Q
What is Diracs’ theorem?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/811/381/a_image_thumb.png?1650879268)
8
Q
What is Posa’s algorithm?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/812/097/a_image_thumb.png?1650879305)
9
Q
What is the Travelling Salesman Problem?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/812/249/a_image_thumb.png?1650879354)
10
Q
How do we deal with Hamiltonian cycles in a directed graph?
A
![](https://s3.amazonaws.com/brainscape-prod/system/cm/381/812/772/a_image_thumb.png?1650879386)