Section outline

      • From applications to graphs

      • Review of fundamental graph algorithms

      • Optimization algorithms for graphs:

        • flow

        • matchings

        • connectivity

        • routing

        • Euler tours

        • Hamiltonian tours, etc.

      • Planar Graphs:

        • Dual Graphs

        • Planar Orientations

        • Planar Representations

        • Visibility Representations

      • Graph Visualization:

        • Graphs and Their Drawings

        • Paradigms for Graph Drawing

        • Divide and Conquer Techniques for Drawing Trees and Series-Parallel graphs

        • Flow and Orthogonal Drawings

        • Flow and Upward Planarity

        • Incremental Construction

        • Nonplanar Orientations

        • Layered Drawings of Digraphs

        • Force-Directed Methods

        • Circular Drawings of Graphs

        • Lower Bounds

        • Automatic Label Placement

      • Other Topics.