DeepAI AI Chat
Log In Sign Up

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

by   Assaf Kfoury, et al.
Boston University

We present an alternative and simpler method for computing principal typings of flow networks. When limited to planar flow networks, the method can be made to run in fixed-parameter linear-time -- where the parameter not to be exceeded is what is called the edge-outerplanarity of the networks' underlying graphs.


page 1

page 2

page 3

page 4


A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks

We pull together previously established graph-theoretical results to pro...

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

Tromino Tilings with Pegs via Flow Networks

A tromino tiling problem is a packing puzzle where we are given a region...

A Simple Algorithm for Computing a Cycle Separator

We present a linear time algorithm for computing a cycle separator in a ...

A Compositional Approach to Network Algorithms

We present elements of a typing theory for flow networks, where "types",...

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings

We provide linear-time algorithms for geometric graphs with sublinearly ...

Computing large and small stable models

In this paper, we focus on the problem of existence and computing of sma...