1. Trees Kun-Mao Chao (趙坤茂)
Department of Computer Science and Information Engineering
National Taiwan University, Taiwan
WWW:

2. About this course Course: Special topics on graph algorithms
We will mostly focus on those tree-related algorithmic problems and their applications.
Spring semester, 2019
9: :10 Tuesday, 105 CSIE Building.
3 credits
Web site:

3. Outlines Counting spanning trees Minimum spanning trees
Shortest-paths tree
Minimum routing cost spanning trees
Communication spanning trees
Light approximate spanning trees
Steiner minimal trees
Diameters
Swap edges
Tree splitting
Other advanced topics

4. Coursework: Two midterm exams (35% each)
tentatively on Mar. 26, 2019 and May 14, 2019
Oral presentation or implementation of selected topics or papers (20%)
Homework and class participation (10%)

5. Our book on spanning trees
Spanning Trees and Optimization Problems, by Bang Ye Wu and Kun-Mao Chao (2004), Chapman & Hall/CRC Press, USA.
Link to Amazon

6. Spanning Trees and Optimization Problems
S T O P !
Trees
Optimization
Problems
&
B.Y. Wu and K.-M. Chao
CRC press, 2004