CS254 - Algorithmic Graph Theory

Table of contents

• Content
• Reading List

Module Info

Module Webpage

Professor: Ranko Lazic

Term: 2

Status: Core

Assessment: 80% Exam, 20% Assignments

• Past Papers

Rating

Difficulty:

Professor:

Teaching Style:

Would take again?

Content

1—Basics | 2—Matching | 3—Connectivity | 4—Planar Graphs | 5—Colouring
6—Flows | 7—Substructures in Dense Graphs | 8—Substructures in Sparse Graphs | 9—Ramsey Theory | 10—Hamilton Cycles
11—Random Graphs | 12—Minors, Trees, and wqo |

📈

Introduction To Graphs

Lorem Ipsum yada yada

📊

Basic Algorithmic techniques for graph problems

Lorem Ipsum yada yada

📉

Further Algorithmic Problems on Graphs

Lorem Ipsum yada yada

Reading List

• Talis Aspire