close

Вход

Забыли?

вход по аккаунту

код для вставкиСкачать
7
5
1
3
2
4
Trees
6
8
Kun-Mao Chao (趙坤茂)
Department of Computer Science
and Information Engineering
National Taiwan University, Taiwan
E-mail: [email protected]
WWW: http://www.csie.ntu.edu.tw/~kmchao
About this course
• Course: Special topics on graph algorithms
• We will focus on those tree-related algorithmic
problems. In particular, spanning trees …
• Spring semester, 2009
• Monday 13:20 – 16:20, 105 CSIE Building.
• 3 credits
• Web site:
http://www.csie.ntu.edu.tw/~kmchao/tree09spr
2
Coursework:
• Two midterm exams (35% each)
• Oral presentation of selected topics or
papers (20%)
• Homework and class participation (10%)
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
Swap edges
Tree splitting
Other advanced topics
4
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
Link to CRC Press
5
Spanning
Trees & O
ptimization
Problems !
Spanning
Trees
and
Optimization Problems
B.Y. Wu and K.-M. Chao
CRC press, 2004
Bang Ye’s ppt
1/--страниц
Пожаловаться на содержимое документа