A faster algorithm for computing the strength of a network
From MaRDI portal
Publication:1318743
DOI10.1016/0020-0190(94)90013-2zbMath0795.68152OpenAlexW2043574467MaRDI QIDQ1318743
Eddie Cheng, William H. Cunningham
Publication date: 5 April 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)90013-2
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items
A faster algorithm for computing the principal sequence of partitions of a graph, Comparison of three approaches to studying stability of solutions to problems of discrete optimization and computational geometry, Computing Weighted Strength and Applications to Partitioning, Optimal hierarchical clustering on a graph, Improving graph partitions using submodular functions., A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees, Graphic Submodular Function Minimization: A Graphic Approach and Applications, A linear programming approach to increasing the weight of all minimum spanning trees, Stability of solutions in problems of computational geometry, A kind of conditional connectivity of Cayley graphs generated by wheel graphs, On the \(k\)-cut problem, Transforming a graph into a 1-balanced graph, A new algorithm for the intersection of a line with the independent set polytope of a matroid, Network strength games: the core and the nucleolus, Unnamed Item, On some algorithmic aspects of hypergraphic matroids, Network reinforcement, Vulnerability issues of star graphs, alternating group graphs and split-stars: Strength and toughness, A note on optimal covering augmentation for graphic polymatroids.
Cites Work
