Flow in planar graphs with vertex capacities
type: Item
instance of: scholarly article
title: Flow in planar graphs with vertex capacities
zbMATH Open document ID: 0794.68114
DOI: 10.1007/BF01240733
author: Samir Khuller
author: Joseph (Seffi) Naor
published in: Algorithmica
publication date: 1994-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 529939
zbMATH Keywords: planar graphs
zbMATH Keywords: vertex capacities
zbMATH Keywords: network flow
zbMATH Keywords: circulation problem
MaRDI profile type: Publication
cites work: Q3138984
cites work: Q3097395
cites work: Q3619797
cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
cites work: Maximal Flow Through a Network
cites work: Configuration of VLSI Arrays in the Presence of Defects
cites work: Multi-Terminal Network Flows
cites work: Multi-terminal maximum flows in node-capacitated networks
cites work: The maximum flow problem is log space complete for P
cites work: An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks
cites work: Maximum Flow in Planar Networks
cites work: Efficient Parallel Algorithms for Testingkand Finding Disjoints-tPaths in Graphs
cites work: Generalized Nested Dissection
cites work: Finding small simple cycle separators for 2-connected planar graphs
cites work: Planar graphs: Theory and algorithms
cites work: Fast and efficient solution of path algebra problems
cites work: Minimums-tCut of a Planar Undirected Network in $O(n\log ^2 (n))$ Time
cites work: Q3138924
description: scientific article; zbMATH DE number 529939