%0 Conference Paper %1 conf/cikm/AkibaIY13 %A Akiba, Takuya %A Iwata, Yoichi %A Yoshida, Yuichi %B CIKM %D 2013 %E He, Qi %E Iyengar, Arun %E Nejdl, Wolfgang %E Pei, Jian %E Rastogi, Rajeev %I ACM %K dblp %P 909-918 %T Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction. %U http://dblp.uni-trier.de/db/conf/cikm/cikm2013.html#AkibaIY13 %@ 978-1-4503-2263-8

@inproceedings{conf/cikm/AkibaIY13, added-at = {2018-11-06T00:00:00.000+0100}, author = {Akiba, Takuya and Iwata, Yoichi and Yoshida, Yuichi}, biburl = {https://www.bibsonomy.org/bibtex/215ec24f69a3457051a69001f5f01efdf/dblp}, booktitle = {CIKM}, crossref = {conf/cikm/2013}, editor = {He, Qi and Iyengar, Arun and Nejdl, Wolfgang and Pei, Jian and Rastogi, Rajeev}, ee = {https://doi.org/10.1145/2505515.2505751}, interhash = {4344a621411a12cee476e88e29cc86c4}, intrahash = {15ec24f69a3457051a69001f5f01efdf}, isbn = {978-1-4503-2263-8}, keywords = {dblp}, pages = {909-918}, publisher = {ACM}, timestamp = {2018-11-07T16:49:46.000+0100}, title = {Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction.}, url = {http://dblp.uni-trier.de/db/conf/cikm/cikm2013.html#AkibaIY13}, year = 2013 }