A Compositional Approach to Network Algorithms

05/19/2018
by   Assaf Kfoury, et al.
0

We present elements of a typing theory for flow networks, where "types", "typings", and "type inference" are formulated in terms of familiar notions from polyhedral analysis and convex optimization. Based on this typing theory, we develop an alternative approach to the design and analysis of network algorithms, which we illustrate by applying it to the max-flow problem in multiple-source, multiple-sink, capacited directed planar graphs.

READ FULL TEXT

page 8

page 39

page 40

research
04/22/2022

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs

The vitality of an edge in a graph with respect to the maximum flow betw...
research
07/27/2018

Towards a directed homotopy type theory

In this paper, we present a directed homotopy type theory for reasoning ...
research
12/10/2014

Convergence and rate of convergence of some greedy algorithms in convex optimization

The paper gives a systematic study of the approximate versions of three ...
research
07/18/2018

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks

We present an alternative and simpler method for computing principal typ...
research
11/15/2021

Embeddings of Planar Quasimetrics into Directed ℓ_1and Polylogarithmic Approximation for Directed Sparsest-Cut

The multi-commodity flow-cut gap is a fundamental parameter that affects...
research
05/05/2014

A Continuous Max-Flow Approach to Multi-Labeling Problems under Arbitrary Region Regularization

The incorporation of region regularization into max-flow segmentation ha...
research
01/30/2015

A Proximal Bregman Projection Approach to Continuous Max-Flow Problems Using Entropic Distances

One issue limiting the adaption of large-scale multi-region segmentation...

Please sign up or login with your details

Forgot password? Click here to reset