DeepAI AI Chat
Log In Sign Up

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

07/18/2018
by   Assaf Kfoury, et al.
Boston University
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/11/2018

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

We pull together previously established graph-theoretical results to pro...
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...
07/24/2020

Tromino Tilings with Pegs via Flow Networks

A tromino tiling problem is a packing puzzle where we are given a region...
09/23/2017

A Simple Algorithm for Computing a Cycle Separator

We present a linear time algorithm for computing a cycle separator in a ...
05/19/2018

A Compositional Approach to Network Algorithms

We present elements of a typing theory for flow networks, where "types",...
12/04/2008

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

We provide linear-time algorithms for geometric graphs with sublinearly ...
02/03/2000

Computing large and small stable models

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