Department of Mathematics, Statistics
and Computer Science
Wim Ruitenburg's Fall 2012 MATH 1300-101
Last updated: September 2012
Comments and suggestions: Email wimr@mscs.mu.edu
Touring from chapter 6
We start with graphs without labels.
- We see examples of what is a Hamilton path and what is a Hamilton
circuit.
- We introduce the complete graph K_n on n vertices (or nodes).
Count its number of edges (page 207).
Count its number of Hamilton circuits (page 209).
- On a weighted graph, what is the Traveling Salesman Problem (pages
210-212)?
Why is finding the solution using the Brute-Force method not feasible in
practice (page 216)?
What is the nearest neighbor algorithm (page 215)?
What is the repetitive nearest neighbor algorithm (page 220)?
What is the cheapest-link algorithm (page 221)?
Example Problem(s)
- Recommended problems from Chapter 6 of the book:
1, 5
- Recommended problems from Chapter 6 of the book:
9, 17, 25
- Recommended problems from Chapter 6 of the book:
29, 31ab
- Recommended problems from Chapter 6 of the book:
43