Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction.

@inproceedings{akiba-2013-lineartime, author = {Takuya Akiba and Yoichi Iwata and Yuichi Yoshida}, editor = {Qi He and Arun Iyengar and Wolfgang Nejdl and Jian Pei and Rajeev Rastogi}, title = {{Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction}}, booktitle = {{22nd ACM International Conference on Information and Knowledge Management, CIKM'13, San Francisco, CA, USA, October 27 - November 1, 2013}}, pages = {909--918}, publisher = {ACM}, year = {2013}, url = {https://doi.org/10.1145/2505515.2505751}, doi = {https://doi.org/10.1145/2505515.2505751} }