SemesterFall Semester, 2018
DepartmentMA Program of Computer Science, First Year MA Program of Computer Science, Second Year
Course NameGraph Theory and Its Applications to Networks
InstructorKUO TUNG-WEI
Credit3.0
Course TypeElective
Prerequisite
Course Objective
Course Description
Course Schedule




























































































































































週次



課程主題



課程內容與指定閱讀



教學活動

與作業



學習投入時數

(課堂講授)



學習投入時數

(課堂前後)



1



Introduction (I)



TBA



TBA



3



2



2



Introduction (II)



TBA



TBA



3



2



3



Introduction (III)



TBA



HW1



3



2



4



Euler Tour



TBA



TBA



3



2



5



Hamiltonian cycle (I)



TBA



TBA



3



2



6



Hamiltonian cycle (II)



TBA



HW2



3



2



7



Small World (I)



TBA



TBA



3



2



8



Small World (II)



TBA



TBA



3



2



9



Midterm



N/A



N/A



N/A



2



10



Maximum Cardinality Matching (I)



TBA



TBA



3



2



11



Maximum Cardinality Matching (II)



TBA



TBA



3



2



12



Maximum Weighted Matching (I)



TBA



TBA



3



2



13



Maximum Weighted Matching (II)



TBA



HW3



3



2



14



Dominating Set



TBA



TBA



3



2



15



Coloring



TBA



TBA



3



2



16



No Class



N/A



HW4



N/A



N/A



17



Graph Approximation Algorithm



TBA



TBA



3



2



18



Final



N/A



N/A



N/A



2




 


Teaching Methods
Teaching Assistant
Requirement/Grading

Midterm: 35%

Final: 35%

Homework: 20%

Class Participation: 10%



測驗藍圖

問答題10題

記憶: 10%

理解: 40%

應用: 10%

獨立思考: 40%



 


Textbook & Reference

Graph Theory by Ronald Gould


Urls about Course
Attachment