00:00:00 / 00:00:00
9 10

Lecture 4 - Two-dimensional computational topology

By Jeff Erickson

This series of lectures will describe recent and not-so-recent works in computational topology of curves in the plane and on surfaces. Combinatorial and algorithmic aspects will be discussed.

Lecture 4. Maximum flows and minimum cuts - definitions - flow-cut duality, graph duality, Poincaré duality - planar minimum cuts via MSSP - $\mathbb Z_2$-homology - $\mathbb Z_2$-homology cover - surface mincut via MSSP in homology cover - planar flows via shortest-path pivoting - surface flows via implicit homology-LP

Information about the video

  • Date of recording 21/06/2018
  • Date of publication 26/06/2018
  • Institution IHP
  • Format MP4

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow




Register

  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
    community
  • Get notification updates
    for your favorite subjects
Give feedback