A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
type: Item
instance of: scholarly article
title: A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
zbMATH Open document ID: 1028.90074
DOI: 10.1023/A:1009804919645
author: Hiroshi Nagamochi
author: Shigeki Katayama
author: Toshihide Ibaraki
published in: Journal of Combinatorial Optimization
publication date: 2000-10-30T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1523204
zbMATH Keywords: minimum cuts
zbMATH Keywords: graphs
zbMATH Keywords: \(k\)-way cuts
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: a:1009804919645
OpenAlex ID: W1529019776
description: scientific article; zbMATH DE number 1523204