A physical interpretation of graph connectivity, and its algorithmic applications
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
On the (co)girth of a connected matroid
Discrete Applied Mathematics
SkyGraph: an algorithm for important subgraph discovery in relational graphs
Data Mining and Knowledge Discovery
Yet another optimal algorithm for 3-edge-connectivity
Journal of Discrete Algorithms
Environmental Modelling & Software
Efficiently computing k-edge connected components via graph decomposition
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
An overview of algorithms for network survivability
ISRN Communications and Networking
| Hi-index | 0.00 |
We describe an algorithm that determines the edge connectivity of an n-vertex m-edge graph G in O(nm) time. A refinement shows that the question as to whether a graph is k-edge connected can be determined in O(kn2). For dense graphs characterized by m = Ω(n2), the latter result implies that determination of whether a graph is k-edge connected for any fixed k can be accomplished in time linear in input size.