A simple and fast min-cut algorithm
type: Item
instance of: scholarly article
title: A simple and fast min-cut algorithm
zbMATH Open document ID: 1117.05066
author: Michael Brinkmeier
published in: Theory of Computing Systems
publication date: 2007-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5187751
MaRDI profile type: MaRDI publication profile
full work available at URL: s00224-007-2010-2
OpenAlex ID: W1999602503
DOI: 10.1007/S00224-007-2010-2
Recommended article: Fundamentals of Computation Theory
Recommended article: A simple min-cut algorithm
Recommended article: Q6059171
Recommended article: A simple minimum \(T\)-cut algorithm
Recommended article: Q4763403
Recommended article: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
Recommended article: A faster parametric minimum-cut algorithm
Recommended article: Q4263725
Recommended article: A fast algorithm for computing minimum 3-way and 4-way cuts
Recommended article: Minimum Cuts of Simple Graphs in Almost Always Linear Time
description: scientific article; zbMATH DE number 5187751