Homepage of Yukiko Kenmochi
剣持雪子のページ
Graph Algorithm (2017-2018)
Instructor : Yukiko Kenmochi
The course description written by Jean Cousty for the previous years can be found here.
The course contains 5 lectures, 4 excercies, and 4 laboratory sessions.
The couse materials are provided by Jean Cousty.
Lecture 1 (15/11/2017)
- Topic: Introduction and basic notions
- Slides: ga1.pdf
Laboratory session 1 (15/11/2017)
- Subject: First graphs and algorithms
- Insturctions: ga_tp1.pdf
- Deadline for code and report: November 20, 2017.
Lecture 2 (17/11/2017)
- Topic: Connectivity in graphs
- Slides: ga2.pdf
Excercises 1 & 2 (22/11/2017)
- Subject: Cyber-profiler
- Download the excercises here.
Laboratory session 2 (29/11/2017)
- Subject: Friends, bipartite graphs and cycles of odd length
- Instructions: Go to this web site (skip Section 1).
- Deadline for code and report: December 6, 2017.
Lecture 3 (6/12/2017)
- Topic: Shortest paths
- Slides: ga3.pdf
Excercise 3 (6/12/2017)
- Subject: Floyd algorithm
- Download the excercises here.
Lecture 4 (13/12/2017)
- Topic: Trees
- Slides: ga4.pdf
Laboratory session 3 (13/12/2017)
- Subject: A journey in the metro
- Instructions: Go to this web site.
- Deadline for code and report: December 20, 2017.
Lecture 5 (15/12/2017)
- Topic: Minimum spanning tree
- Slides: ga5.pdf
Excercise 4 (15/12/2017)
- Subject: In the wood - Spy games - Anlysis of trajectories
- Download the excercises here.
Laboratory session 4 (20/12/2017)
Exam (10/1/2018)
© Yukiko Kenmochi - 2013. Generated in 1713446915.765 seconds and visited times. You are IP: 18.190.153.51 (ec2-18-190-153-51.us-east-2.compute.amazonaws.com under Undefined)