Characterizing multiterminal flow networks and computing flows in networks of small treewidth
type: Item
instance of: scholarly article
title: Characterizing multiterminal flow networks and computing flows in networks of small treewidth
zbMATH Open document ID: 0917.68013
author: Torben Hagerup
author: Jyrki Katajainen
author: N. Nishimura
author: Prabhakar Ragde
published in: Journal of Computer and System Sciences
publication date: 1999-02-21T00:00:00Z
Mathematics Subject Classification ID: 68M10
zbMATH DE Number: 1252385
zbMATH Keywords: flow network
zbMATH Keywords: bounded treewidth
zbMATH Keywords: EREW PRAM
MaRDI profile type: Publication
full work available at URL: jcss.1998.1592
OpenAlex ID: W2039305125
cites work: Q3056948
cites work: All-pairs min-cut in sparse networks
cites work: Easy problems for tree-decomposable graphs
cites work: Q4734761
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth
cites work: Linear programming in \(O(n\times 3^{d^2})\) time
cites work: Deterministic coin tossing with applications to optimal parallel list ranking
cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
cites work: On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre Problem
cites work: Q5514188
cites work: A theorem on flows in networks
cites work: Processor-efficient implementation of a maximum flow algorithm
cites work: The maximum flow problem is log space complete for P
cites work: Q3274170
cites work: Q4023519
cites work: Constructing a perfect matching is in random NC
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: An O(n2log n) parallel max-flow algorithm
cites work: Q4385515
cites work: Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time
DOI: 10.1006/JCSS.1998.1592
description: scientific article; zbMATH DE number 1252385