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 focus on those tree-related algorithmic problems. In particular, spanning trees …
Spring semester, 2004
Thursday 14:20 – 15:20, 409 CSIE Building.
3 credits
Web site:

3. Coursework: Midterm exam (45%)
Oral presentation of selected topics or papers (40%)
Homework and class participation (15%)

4. 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
Trees and diameters
Other advanced topics

5. Our new 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
Link to CRC Press

6. Knuth’s recent talk on spanning trees
Donald E. Knuth gave a lecture on spanning trees last December. (In fact, he likes to talk about trees in the Christmas season. Christmas trees …)
Try it?

7. Spanning Trees and Optimization Problems
S T O P !
Trees
Optimization
Problems
&
B.Y. Wu and K.-M. Chao
CRC press, 2004
It’s available now!
Bang Ye’s ppt