Lectures related to Shortest Path Algorithm

Documenta Fifteen: Recap and Artistic Direction

Explores the genesis of the documenta concept and showcases artworks while discussing themes of collective care, sustainability, and community in art.

Handling Network Data

Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.

Untitled

Algorithmic Paradigms for Dynamic Graph Problems

Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.

The Transhipment and Transportation Problems

Covers the transhipment and transportation problems in electricity distribution in Switzerland.

Shortest Paths: Bellman-Ford and Dijkstra

Covers the Bellman-Ford and Dijkstra algorithms for finding shortest paths in graphs with different edge weights.

Untitled

Lattice Systems: Structural Equilibrium

Explores lattice systems, emphasizing static equilibrium and force diagram construction in structural analysis.