Department of Mathematics, Statistics
and Computer Science
Wim Ruitenburg's Spring 2017 MATH 1300-101
Last updated: February 2017
Comments and suggestions: Email wim.ruitenburg@marquette.edu
Book, chapter 6 on touring
We start with graphs without weights.
- 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 181).
Count its number of Hamilton paths (page 181).
Count its number of Hamilton circuits (page 181).
Next, graphs with weights.
- On a weighted graph, what is the Traveling Salesperson Problem (page
176)?
Why is finding the solution using the Brute-Force method not feasible in
practice (pages 183-185)?
What is the nearest neighbor algorithm (page 189)?
What is the repetitive nearest neighbor algorithm (page 190)?
What is the cheapest-link algorithm (page 191)?
Example Problems
- Recommended problems from Chapter 6 of the book:
1, 5, 15
- (a) Compute 6!
(b) Compute 11! / 9!
(c) Compute 101! / 99!
- Recommended problems from Chapter 6 of the book:
24, 27, 35ab, 36
- Recommended problems from Chapter 6 of the book:
52