Generalizing the all-pairs min cut problem
type: Item
instance of: scholarly article
title: Generalizing the all-pairs min cut problem
zbMATH Open document ID: 0841.05015
DOI: 10.1016/0012-365X(94)00233-9
published in: Discrete Mathematics
publication date: 1996-03-24T00:00:00Z
review text: It is shown how the all-pairs min cut problem can be generalized to matroids.
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 858055
zbMATH Keywords: min cut problem
zbMATH Keywords: matroids
author: David Hartvigsen
reviewed by: Martin Loebl
MaRDI profile type: Publication
cites work: Q3760253
cites work: Q5737094
cites work: Q5514188
cites work: Q5572841
cites work: Über reguläre Kettengruppen
cites work: Multi-Terminal Network Flows
cites work: Multi-terminal maximum flows in node-capacitated networks
cites work: Solution Bases of Multiterminal Cut Problems
cites work: Q5595961
cites work: Q4130999
cites work: Q5516084
cites work: Q5638111
cites work: The matroids with the max-flow min-cut property
cites work: Q4139949
cites work: Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
cites work: Q4004142
cites work: A decomposition of the matroids with the max-flow min-cut property
cites work: Q4111952
full work available at URL: 0012-365x(94)00233-9
OpenAlex ID: W1969525246
Recommended article: The All-Pairs Min Cut Problem and the Minimum Cycle Basis Problem on Planar Graphs
Recommended article: Q5091155
Recommended article: All-pairs min-cut in sparse networks
Recommended article: All-Pairs Min-Cut in Sparse Networks
Recommended article: Minimum \(T\)-cuts and optimal \(T\)-pairings
Recommended article: Generalized \(k\)-multiway cut problems
Recommended article: A new approach to the minimum cut problem
Recommended article: Q5874530
Recommended article: All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
Recommended article: A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
description: scientific article; zbMATH DE number 858055