-
- 주제분류
- 공학 >컴퓨터ㆍ통신 >정보통신공학
-
- 강의학기
- 2012년 2학기
-
- 조회수
- 6,989
-
This lecture focuses on incremental method. It shows detail procedure of each algorithm such as max flow problem (Ford-Fulkerson), maximum matching in graph and Chinese postman problem (Eulerian cycle)
연관 자료







