Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
type: Item
instance of: scholarly article
title: Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
zbMATH Open document ID: 1187.68689
author: Li-Pu Yeh
author: Biing-Feng Wang
author: Hsin-Hao Su
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5674323
zbMATH Keywords: algorithms
zbMATH Keywords: graphs
zbMATH Keywords: minimum cuts
zbMATH Keywords: maximum flows
zbMATH Keywords: suboptimal cuts
zbMATH Keywords: enumeration
MaRDI profile type: Publication
full work available at URL: s00453-009-9284-5
OpenAlex ID: W2020816761
cites work: Q3056948
cites work: A new and improved algorithm for the 3-cut problem
cites work: Q5501810
cites work: Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
cites work: A new approach to the maximum-flow problem
cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k
cites work: Multi-Terminal Network Flows
cites work: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
cites work: Practical performance of efficient minimum cut algorithms
cites work: A divide-and-conquer approach to the minimum \(k\)-way cut problem.
cites work: A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
cites work: Minimum cuts in near-linear time
cites work: A new approach to the minimum cut problem
cites work: Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
cites work: A Faster Deterministic Maximum Flow Algorithm
cites work: Q4952694
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: A fast algorithm for computing minimum 3-way and 4-way cuts
cites work: Implementing an efficient minimum capacity cut algorithm
cites work: Computing All Small Cuts in an Undirected Network
cites work: A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
cites work: On the structure of all minimum cuts in a network and applications
cites work: Q3549696
cites work: Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
DOI: 10.1007/S00453-009-9284-5
description: scientific article; zbMATH DE number 5674323