A faster parametric minimum-cut algorithm
type: Item
instance of: scholarly article
title: A faster parametric minimum-cut algorithm
zbMATH Open document ID: 0795.68099
DOI: 10.1007/BF01240737
author: Dan Gusfield
author: Éva Tardos
published in: Algorithmica
publication date: 1994-09-11T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 529943
zbMATH Keywords: network flow
zbMATH Keywords: cuts
zbMATH Keywords: parametric cuts
zbMATH Keywords: graph algorithms
zbMATH Keywords: layout
MaRDI profile type: Publication
cites work: Analysis of Preflow Push Algorithms for Maximum Network Flow
cites work: Multifacility Location Problem with Rectilinear Distance by the Minimum-Cut Approach
cites work: Q3292914
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Q3352816
cites work: A new approach to the maximum-flow problem
cites work: Computing the Strength of a Graph
cites work: Q3995616
cites work: Parametric stable marriage and minimum cuts
cites work: A fast algorithm for the generalized parametric minimum cut problem and applications
cites work: Q3048571
cites work: A comparison of phase and nonphase network flow algorithms
cites work: A Cut Approach to the Rectilinear Distance Facility Location Problem
cites work: Q3707420
cites work: Effective algorithm for the weber problem with a rectangular metric
full work available at URL: https://doi.org/10.1007/bf01240737
OpenAlex ID: W2020870396
description: scientific article; zbMATH DE number 529943