Algorithms for Planar Graphs (Fall 2015)

Shay Mozes

Lecture 2 Video [previous] [next]

[+] Basics II

We continue with basic definitions and properties. We recap the definition of embedding and duality, define and deletion and contractions of edges. We discuss basic connectivity properties of embedded graphs and their duals. We then define planar graphs and mention two important structural properties: interdigitating trees and duality of simple cuts and simple cycles.

Download Video: 720p

Lecture notes, page 1/8 • [previous page] • [next page] • [PDF]

The video above should play if your web browser supports either modern Flash or HTML5 video with H.264 or WebM codec. The lecture notes should advance automatically. If you have any trouble with playback, email me.