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

Lecture

Networks, Flows

Description

This lecture covers the definition of flow in a network, the calculation of flow through a cut, and the concept of simple path flow, providing examples and a summary at the end.

In MOOC

Optimization: principles and algorithms - Network and discrete optimization

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (22)

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Glossary of graph theory

This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.

Connectivity (graph theory)

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.

Path (graph theory)

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.

Vertex (graph theory)

In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.

Related lectures (32)

Graph Models and Brain Connectomics

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.

Topology in Complex Networks: Insights from Topological Data Analysis

Explores the role of higher-order topological properties in complex networks using topological data analysis for structural break and price anomaly detection.

Non-parametric regression for networks

Explores non-parametric regression for networks, covering object data analysis, network graphs, extrinsic distances, and practical projections.

Introduction to Networks and Brain Networks

Introduces the fundamentals of network science, focusing on brain networks and their historical breakthroughs.

Handling Networks: Graph Theory

Covers the fundamentals of handling networks and centrality measures in graph theory.