Approximation Schemes In Planar Graphs: Branchwidth and Baker's
By Shay Mozes - MIT
-
406
- Report An Inaccuracy In Lecture Information:
Lecture Description
In this lecture we introduce two additional graph decompositions - carving decomposition and branch decomposition. We prove a theorem of Tamaki that roughly says that the branch-width of a planar graph is at most twice its radius.
Course Description
Graphs in the real world tend to have a lot of special structure. In particular, graphs arising on this planet are often planar (or nearly so), meaning that they can be drawn in the plane or a sphere without any (or with few) edge crossings. This class is about efficient algorithms that exploit the structure of planar graphs and related graph classes, specifically graphs embeddable on a surface of low genus and graphs excluding a minor. We will focus on recent results in this exciting area (which all of the instructors actively do research in).
We will organize an optional problem-solving session, during which we can jointly try to solve open problems. In the past, these sessions have led to important new results and published papers, as well as class projects.
Class projects more generally can take the form of formulations of clean, new open problems; implementations of existing algorithms; or well-written descriptions of one or more papers in the area. Projects can be purely mathematical and/or theoretical computer science (algorithmic/complexity theoretic), or purely practical.
Course Index
Show:
