01:07:11
publiée le 23 décembre 2025
Organising large proofs: techniques, tools, and future
De Georges Gonthier
Lecture 3 - Two-dimensional computational topology
Apparaît dans la collection : School on Low-Dimensional Geometry and Topology: Discrete and Algorithmic Aspects
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 3. Shortest paths and cycles - Dijkstra’s algorithm - tree-cotree decompositions again - pivots and slack - multiple-source shortest paths - shortest nontrivial cycles - combinatorial vs. Riemannian systole bounds
