Implementing an efficient minimum capacity cut algorithm
type: Item
instance of: scholarly article
title: Implementing an efficient minimum capacity cut algorithm
zbMATH Open document ID: 0821.90130
DOI: 10.1007/BF01582226
author: Hiroshi Nagamochi
author: Tadashi Ono
author: Toshihide Ibaraki
published in: Mathematical Programming. Series A. Series B
publication date: 1995-09-27T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 755377
zbMATH Keywords: polynomial algorithm
zbMATH Keywords: minimum capacity cut
zbMATH Keywords: undirected network
MaRDI profile type: Publication
cites work: Q3292914
cites work: On sparse subgraphs preserving connectivity properties
cites work: A new approach to the maximum-flow problem
cites work: Multi-Terminal Network Flows
cites work: Q4763403
cites work: An Õ(n2) algorithm for minimum cuts
cites work: A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: An efficient algorithm for the minimum capacity cut problem
full work available at URL: https://doi.org/10.1007/bf01582226
OpenAlex ID: W2042852020
Recommended article: An efficient algorithm for the minimum capacity cut problem
Recommended article: Efficient algorithms for minimum range cut problems
Recommended article: Practical performance of efficient minimum cut algorithms
Recommended article: Q4037409
Recommended article: Practical Minimum Cut Algorithms
Recommended article: A simple and fast min-cut algorithm
Recommended article: Fundamentals of Computation Theory
Recommended article: Q6059171
Recommended article: Q4228454
description: scientific article; zbMATH DE number 755377