DeepAI AI Chat
Log In Sign Up

A Compositional Approach to Network Algorithms

by   Assaf Kfoury, et al.
Boston University

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.


page 8

page 39

page 40


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...

Towards a directed homotopy type theory

In this paper, we present a directed homotopy type theory for reasoning ...

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

The paper gives a systematic study of the approximate versions of three ...

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...

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

The incorporation of region regularization into max-flow segmentation ha...

A theory of continuous generative flow networks

Generative flow networks (GFlowNets) are amortized variational inference...