Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
type: Item
instance of: scholarly article
title: Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
zbMATH Open document ID: 0897.68074
author: Karsten Weihe
published in: Journal of Computer and System Sciences
publication date: 1998-08-04T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 1140556
zbMATH Keywords: planar graph
MaRDI profile type: Publication
full work available at URL: jcss.1997.1538
OpenAlex ID: W1969523663
cites work: Q3056948
cites work: TWO THEOREMS IN GRAPH THEORY
cites work: Maximal Flow Through a Network
cites work: A new approach to the maximum-flow problem
cites work: An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
cites work: Efficient Planarity Testing
cites work: Q5595961
cites work: Maximum Flow in Planar Networks
cites work: The Lattice Structure of Flow in Planar Graphs
cites work: Faster shortest-path algorithms for planar graphs
cites work: Planar graphs: Theory and algorithms
cites work: A data structure for dynamic trees
cites work: Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time
DOI: 10.1006/JCSS.1997.1538
description: scientific article; zbMATH DE number 1140556