Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

K-edge-connected graph

Related lectures (15)

Algebraic Graph Theory: Matrices and Connectivity

Explores algebraic graph theory applied to networked control systems and consensus algorithms.

Linear Algebra: Matrices and Linear Applications

Covers matrices, linear applications, vector spaces, and bijective functions.

Networked Control Systems: Properties of Laplacian Matrices

Explores Laplacian matrix properties in networked control systems and their relation to graph theory.

Max-flow Min-cut Theorem

Explores the equivalence between maximum flow and minimum cut in network theory, demonstrating its applications through examples and edge-disjoint paths.

Algorithms: Union Find and Minimum Spanning Trees

Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.

Laplacian Matrix: Properties and Examples

Explores the Laplacian matrix, time-varying consensus theorems, and balanced graphs in networked control systems.

Minimum Guardians in Graphs

Explores the concept of minimizing guardians in graphs through strategic edge selection.

Causal Inference: Learning Graph Structures

Explores causal inference through learning graph structures for causal reasoning from observational data.

Networked Control Systems: Properties and Connectivity

Explores properties of matrices, irreducibility, and graph connectivity in networked control systems.

Irreducible Matrices and Strong Connectivity

Explores irreducible matrices and strong connectivity in networked control systems, emphasizing the importance of adjacency matrices and graph structures.

Low Diameter Random Partitioning Log in to Mediaspace to watch this video

Discusses Low Diameter Randomized Decomposition and graph partitioning for edge cuts and coloring.

Algorithmic Paradigms for Dynamic Graph Problems Log in to Mediaspace to watch this video

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

Max-flow and Disjoint Sets Log in to Mediaspace to watch this video

Explores the Ford-Fulkerson method, max-flow, applications of max-flow, and the disjoint-set data structure.

Neuronal Connectivity Patterns Log in to Mediaspace to watch this video

Explores neuronal connectivity patterns, connection probabilities, and experimental techniques used to study synaptic connectivity.

Max-flow Min-cut Theorem Log in to Mediaspace to watch this video

Explores the Max-flow Min-cut theorem, integral capacities, Ford-Fulkerson method, bipartite matching, and edge-disjoint paths.