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

07/11/2018
by   Assaf Kfoury, et al.
0

We pull together previously established graph-theoretical results to produce the algorithm in the paper's title. The glue are three easy elementary lemmas.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
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
09/23/2017

A Simple Algorithm for Computing a Cycle Separator

We present a linear time algorithm for computing a cycle separator in a ...
research
07/24/2020

Tromino Tilings with Pegs via Flow Networks

A tromino tiling problem is a packing puzzle where we are given a region...
research
02/17/2022

An Optimal Algorithm for Product Structure in Planar Graphs

The Product Structure Theorem for planar graphs (Dujmović et al.JACM, 67...
research
05/03/2022

Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time

We present a nearly-linear time algorithm for finding a minimum-cost flo...
research
11/21/2020

lospre in linear time

Lifetime-optimal speculative partial redundancy elimination (lospre) is ...

Please sign up or login with your details

Forgot password? Click here to reset