Sparsest cuts and concurrent flows in product graphs.
type: Item
instance of: scholarly article
title: Sparsest cuts and concurrent flows in product graphs.
zbMATH Open document ID: 1036.90023
DOI: 10.1016/S0166-218X(03)00439-6
author: Paul Bonsma
published in: Discrete Applied Mathematics
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C99
zbMATH DE Number: 2055503
zbMATH Keywords: Product graph
zbMATH Keywords: Sparsest cut
zbMATH Keywords: Concurrent flow
zbMATH Keywords: Bottleneck graph
MaRDI profile type: Publication
cites work: An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
cites work: Q4079613
cites work: Q4342632
cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
cites work: Q3691767
cites work: Sparsest cuts and bottlenecks in graphs
cites work: The maximum concurrent flow problem
cites work: Q4387700
full work available at URL: s0166-218x(03)00439-6
OpenAlex ID: W2033961184
Recommended article: Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem
Recommended article: Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem
Recommended article: Sparsest cuts and bottlenecks in graphs
Recommended article: Q3104376
Recommended article: Q4387700
Recommended article: Sums and products along sparse graphs
Recommended article: Linear time algorithms for finding sparsest cuts in various graph classes
Recommended article: The complexity of finding uniform sparsest cuts in various graph classes
Recommended article: Sparse Cut Projections in Graph Streams
Recommended article: Minimum Cuts and Sparsification in Hypergraphs
description: scientific article; zbMATH DE number 2055503