Related papers: Single-Source Unsplittable Flows in Planar Graphs
Emerging reconfigurable optical communication technologies allow to enhance datacenter topologies with demand-aware links optimized towards traffic patterns. This paper studies the algorithmic problem of jointly optimizing topology and…
Slug flows are a typical intermittent two-phase flow pattern that can occur in submarine pipelines connecting the wells to the production facility and that is known to cause undesired consequences. In this context, computational fluid…
Network flows often exhibit a hierarchical tree-like structure that can be attributed to the minimisation of dissipation. The common feature of such systems is a single source and multiple sinks (or vice versa). In contrast, here we study…
Oftentimes observed divergence of numerical solutions to benchmark flows of the UCM viscoelastic fluid is a known and widely discussed issue. Some authors consider such singularities 'invincible'. Following the previous research, the…
We give an $O(n^{1.5} \log n)$ algorithm that, given a directed planar graph with arc capacities, a set of source nodes and a set of sink nodes, finds a maximum flow from the sources to the sinks.
An improved fully polynomial-time approximation scheme and a greedy heuristic for the fractional length-bounded maximum multicommodity flow problem with unit edge-lengths are proposed. Computational experiments are carried out on benchmark…
Let $G=(V,E)$ be a supply graph and $H=(V,F)$ a demand graph defined on the same set of vertices. An assignment of capacities to the edges of $G$ and demands to the edges of $H$ is said to satisfy the \emph{cut condition} if for any cut in…
Our capacity to learn representations from data is related to our ability to design filters that can leverage their coupling with the underlying domain. Graph filters are one such tool for network data and have been used in a myriad of…
One may trace the idea that spectral flow should be given as the integral of a one form back to the 1974 Vancouver ICM address of I.M. Singer. Our main theorem gives analytic formulae for the spectral flow along a norm differentiable path…
A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…
Linear stability of inviscid, parallel, and stably stratified shear flow is studied under the assumption of smooth strictly monotonic profiles of shear flow and density, so that the local Richardson number is positive everywhere. The…
We provide a new algebraic technique to solve the sequential flow problem in polynomial space. The task is to maximise the flow through a graph where edge capacities can be changed over time by choosing a sequence of capacity labelings from…
Optimal power flow (OPF) is a critical optimization problem that allocates power to the generators in order to satisfy the demand at a minimum cost. Solving this problem exactly is computationally infeasible in the general case. In this…
For the water waves equations, the existence of splat singularities has been shown in [3], i.e., the interface self-intersects along an arc in finite time. The aim of this paper is to show the absence of splat singularities for the…
The GC problem is to identify a pre-determined number of center vertices such that the distances or costs from (or to) the centers to (or from) other vertices is minimized. The bottleneck of a path is the minimum capacity of edges on the…
Given a graph $G$, a set $T$ of terminal vertices, and a demand graph $H$ on $T$, the \textsc{Multicut} problem asks for a set of edges of minimum weight that separates the pairs of terminals specified by the edges of $H$. The…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
The one-way model of quantum computation is an alternative to the circuit model. A one-way computation is driven entirely by successive adaptive measurements of a pre-prepared entangled resource state. For each measurement, only one outcome…
Graphene provides a fascinating testbed for new physics and exciting opportunities for future applications based on quantum phenomena. To understand the coherent flow of electrons through a graphene device, we employ a nanoscale probe that…
Consider a simple finite graph and its nodes to represent identical water barrels (containing different amounts of water) on a level plane. Each edge corresponds to a (locked, water-filled) pipe connecting two barrels below the plane. We…