DeepAI AI Chat

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

07/11/2018

∙

by Assaf Kfoury, et al.

∙

Boston University

∙

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

0 Assaf Kfoury, et al. ∙

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

0 Giorgio Ausiello, et al. ∙

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

0 Sariel Har-Peled, et al. ∙

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

0 Javier T. Akagi, et al. ∙

research

∙ 11/04/2020

Max-flow vitality in undirected unweighted planar graphs

We show a fast algorithm for determining the set of relevant edges in a ...

0 Giorgio Ausiello, et al. ∙

research

∙ 07/04/2019

Min-Cost Flow in Unit-Capacity Planar Graphs

In this paper we give an O((nm)^2/3 C) time algorithm for computing min-...

0 Adam Karczmarz, et al. ∙

research

∙ 06/03/2018

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks

Evacuation in emergency situations can be modeled by a dynamic flow netw...

0 Binay Bhattacharya, et al. ∙

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

Related Research

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

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

A Simple Algorithm for Computing a Cycle Separator

Tromino Tilings with Pegs via Flow Networks

Max-flow vitality in undirected unweighted planar graphs

Min-Cost Flow in Unit-Capacity Planar Graphs

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks