A faster algorithm for computing the strength of a network
type: Item
instance of: scholarly article
title: A faster algorithm for computing the strength of a network
zbMATH Open document ID: 0795.68152
DOI: 10.1016/0020-0190(94)90013-2
author: Eddie Cheng
author: William H. Cunningham
published in: Information Processing Letters
publication date: 1994-04-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 540886
zbMATH Keywords: network survivability
zbMATH Keywords: ratio minimization
zbMATH Keywords: strength
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90013-2
OpenAlex ID: W2043574467
cites work: Separating from the dominant of the spanning tree polytope
cites work: Optimal attack and reinforcement of a network
cites work: Q5684698
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Connectivity and edge-disjoint spanning trees
cites work: Computing the Strength of a Graph
description: scientific article; zbMATH DE number 540886