Minimum cuts in near-linear time
type: Item
instance of: scholarly article
title: Minimum cuts in near-linear time
zbMATH Open document ID: 1094.68613
DOI: 10.1145/331605.331608
published in: Journal of the ACM
publication date: 2006-09-12T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5052708
zbMATH Keywords: time bounds
zbMATH Keywords: minimum cut problem on undirected graphs
zbMATH Keywords: randomized Monte Carlo algorithm
author: David R. Karger
MaRDI profile type: Publication
OpenAlex ID: W1964510837
Wikidata QID: Q128379265
Recommended article: Q4228454
Recommended article: Q6059171
Recommended article: Deterministic mincut in almost-linear time
Recommended article: Minimum Cuts of Simple Graphs in Almost Always Linear Time
Recommended article: Practical Minimum Cut Algorithms
Recommended article: Approximating Minimum Cut with Bounded Size
Recommended article: Q4228453
Recommended article: A simple and fast min-cut algorithm
Recommended article: Fundamentals of Computation Theory
description: scientific article; zbMATH DE number 5052708