A faster algorithm for computing the strength of a network

Authors:
Eddie Cheng;William H. Cunningham
Affiliations:
-;-
Venue:
Information Processing Letters
Year:
1994

Citing 0
Cited 8

Algorithms for graphic polymatroids and parametric s-Sets

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Increasing the weight of minimum spanning trees

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Stability Analysis in Optimization Problems on Matroids in the Metric l_1

Cybernetics and Systems Analysis
Fast On-Line/Off-Line Algorithms for Optimal Reinforcement of a Network and Its Connections with Principal Partition

FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Improving graph partitions using submodular functions

Discrete Applied Mathematics - Submodularity
Transforming a graph into a 1-balanced graph

Discrete Applied Mathematics
A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees

Information Sciences: an International Journal
On the k-cut problem

Operations Research Letters

Quantified Score

Hi-index	0.89

Visualization

Abstract