Related papers: A node-capacitated Okamura-Seymour theorem

Stable flows generalize the well-known concept of stable matchings to markets in which transactions may involve several agents, forwarding flow from one to another. An instance of the problem consists of a capacitated directed network, in…

We prove the existence of self-similar expanding solutions of the curvature flow on planar networks where the initial configuration is any number of half-lines meeting at the origin. This generalizes recent work by Schn\"urer and Schulze…

Connectivity (or equivalently, unweighted maximum flow) is an important measure in graph theory and combinatorial optimization. Given a graph $G$ with vertices $s$ and $t$, the connectivity $\lambda(s,t)$ from $s$ to $t$ is defined to be…

Bounds of total curvature and entropy are two common conditions placed on mean curvature flows. We show that these two hypotheses are equivalent for the class of ancient complete embedded smooth planar curve shortening flows, which are…

In this article, we prove two "global existence and full convergence theorems" for flow lines of the M\"obius-invariant Willmore flow, and we use these results, in order to prove that fully and smoothly convergent flow lines of the…

We prove several geometric theorems using tools from the theory of convex optimization. In the Riemannian setting, we prove the max flow-min cut theorem for boundary regions, applied recently to develop a "bit-thread" interpretation of…

The continuum limit provides a useful tool for analyzing coupled oscillator networks. Recently, Medvedev (Comm. Math. Sci., 17 (2019), no. 4, pp. 883-898) gave a mathematical foundation for such an approach when the networks are defined on…

Among the models of quantum computation, the One-way Quantum Computer is one of the most promising proposals of physical realization, and opens new perspectives for parallelization by taking advantage of quantum entanglement. Since a…

Maximum flow (and minimum cut) algorithms have had a strong impact on computer vision. In particular, graph cuts algorithms provide a mechanism for the discrete optimization of an energy functional which has been used in a variety of…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Network flow interdiction analysis studies by how much the value of a maximum flow in a network can be diminished by removing components of the network constrained to some budget. Although this problem is strongly NP-complete on general…

In this paper, we bound the integrality gap and the approximation ratio for maximum plane multiflow problems and deduce bounds on the flow-cut-gap. Planarity means here that the union of the supply and demand graph is planar. We first prove…

Let G be a finite graph with the non-k-order property (essentially, a uniform finite bound on the size of an induced sub-half-graph). A major result of the paper applies model-theoretic arguments to obtain a stronger version of…

A class of graphs is bridge-addable if given a graph $G$ in the class, any graph obtained by adding an edge between two connected components of $G$ is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, that says that…

A comparison theorem for the isoperimetric profile on the universal cover of surfaces evolving by normalised Ricci flow is proven. For any initial metric, a model comparison is constructed that initially lies below the profile of the…

Let $G=(V,E)$ be a graph with four distinguished vertices, two sources $s_1, s_2$ and two sinks $t_1,t_2$, let $c:\, E \rightarrow \mathbb Z_+$ be a capacity function, and let ${\cal P}$ be the set of all simple paths in $G$ from $s_1$ to…

We consider a general stable flow problem in a directed and capacitated network, where each vertex has a strict preference list over the incoming and outgoing edges. A flow is stable if no group of vertices forming a path can mutually…

Flow sparsification is a classic graph compression technique which, given a capacitated graph $G$ on $k$ terminals, aims to construct another capacitated graph $H$, called a flow sparsifier, that preserves, either exactly or approximately,…

The Squire's theorem holds for parallel shear flows governed by the linearized Navier-Stokes equations. Squire writes ``For the study of the stability of flow between parallel walls it is sufficient to confine attention to disturbances of…

We consider closed immersed hypersurfaces in $\R^{3}$ and $\R^4$ evolving by a class of constrained surface diffusion flows. Our result, similar to earlier results for the Willmore flow, gives both a positive lower bound on the time for…