Trees Kun-Mao Chao (趙坤茂 ) Department of Computer Science and Information Engineering National Taiwan University, Taiwan E-mail: kmchao@csie. ntu. edu. tw WWW: http: //www. csie. ntu. edu. tw/~kmchao 1
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: http: //www. csie. ntu. edu. tw/~kmchao/tree 04 spr 2
Coursework: • Midterm exam (45%) • Oral presentation of selected topics or papers (40%) • Homework and class participation (15%) 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 Trees and diameters Other advanced topics 4
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 5
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? 6
Spanning Trees & O ptimization P roblems ! Spanning Trees and Optimization Problems B. Y. Wu and K. -M. Chao CRC press, 2004 It’s available now! Bang Ye’s ppt
Скачать презентацию Trees Kun-Mao Chao 趙坤茂 Department of Computer
2e6c5b893ff6bf5bd316cf2441f03148.ppt