CO 442

Connectivity (Menger's Theorem, ear decomposition, and Tutte's Wheels Theorem) and matchings (Hall's Theorem and Tutte's Theorem). Flows: integer and group-valued flows, the flow polynomial, the 6-flow theorem. Ramsey theory: upper and lower bounds, explicit constructions. External graph theory: Turan's theorem, the Erdos-Gallai theorem. Probabilistic methods.

View [Coming Soon]
CO 342

An introduction to some of the key topics in graph theory: connectivity, planarity and matchings. Connectivity: Menger's Theorem, 3-connected graphs. Planarity: Kuratowski's Theorem, uniqueness of planar embeddings. Matchings: Review of Konig's Theorem, Tutte's Theorem.

View
CO 351

Review of linear programming. Shortest path problems. The max-flow min-cut theorem and applications. Minimum cost flow problems. Network simplex and primal-dual algorithms. Applications to problems of transportation, distribution, job assignments and critical-path planning.

View
MATH 239

Introduction to graph theory: colourings, connectivity, Eulerian tours, planarity.

ViewDisclaimer: All notes are taken from lectures at university of Waterloo. Any time this is regarded inappropriate, contact me via email - x85gao at uwaterloo dot ca.

Node.js

A complete Tutorial on Node.js (Third-Party Library & API, Writing REST API, Template Engine, ES6, Deployment, Mocha Testing, Security & Authentication)

View
Github SSH

A brief tutorial on how to setup SSH connection to GitHub.

View
Angular Routing

A tutorial specifically on Angular routing.

ViewDisclaimer: All tutorials are personally made based on online paid or free resources. Any time this is regarded inappropriate, contact me via email - x85gao at uwaterloo dot ca.