@inproceedings{ Akiba2013,
  address = {New York, New York, USA},
  author = {Akiba, Takuya and Iwata, Yoichi and Yoshida, Yuichi},
  booktitle = {CIKM 2013: the 22nd ACM international conference on Conference on information \& knowledge management},
  doi = {10.1145/2505515.2505751},
  file = {:Users/KunihiroWASA/Dropbox/paper/2013/Akiba, Iwata, Yoshida, Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction, 2013(2).pdf:pdf},
  isbn = {9781450322638},
  keywords = {all or part of,cohesive subgraphs,connectivity,graphs,maximal k -edge-connected subgraph,or,or hard copies of,permission to make digital,random contraction,this work for personal,vertex clusters},
  month = {October},
  pages = {909--918},
  publisher = {ACM Press},
  title = {{Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction}},
  url = {http://dl.acm.org/citation.cfm?id=2505515.2505751 http://dl.acm.org/citation.cfm?doid=2505515.2505751},
  year = {2013}
}

{"_id":"qBoyCK59c6RDb42ee","authorIDs":[],"author_short":["Akiba, T.","Iwata, Y.","Yoshida, Y."],"bibbaseid":"akiba-iwata-yoshida-lineartimeenumerationofmaximalkedgeconnectedsubgraphsinlargenetworksbyrandomcontraction-2013","bibdata":{"address":"New York, New York, USA","author":["Akiba, Takuya","Iwata, Yoichi","Yoshida, Yuichi"],"author_short":["Akiba, T.","Iwata, Y.","Yoshida, Y."],"bibtex":"@inproceedings{ Akiba2013,\n address = {New York, New York, USA},\n author = {Akiba, Takuya and Iwata, Yoichi and Yoshida, Yuichi},\n booktitle = {CIKM 2013: the 22nd ACM international conference on Conference on information \\& knowledge management},\n doi = {10.1145/2505515.2505751},\n file = {:Users/KunihiroWASA/Dropbox/paper/2013/Akiba, Iwata, Yoshida, Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction, 2013(2).pdf:pdf},\n isbn = {9781450322638},\n keywords = {all or part of,cohesive subgraphs,connectivity,graphs,maximal k -edge-connected subgraph,or,or hard copies of,permission to make digital,random contraction,this work for personal,vertex clusters},\n month = {October},\n pages = {909--918},\n publisher = {ACM Press},\n title = {{Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction}},\n url = {http://dl.acm.org/citation.cfm?id=2505515.2505751 http://dl.acm.org/citation.cfm?doid=2505515.2505751},\n year = {2013}\n}","bibtype":"inproceedings","booktitle":"CIKM 2013: the 22nd ACM international conference on Conference on information \\& knowledge management","doi":"10.1145/2505515.2505751","file":":Users/KunihiroWASA/Dropbox/paper/2013/Akiba, Iwata, Yoshida, Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction, 2013(2).pdf:pdf","id":"Akiba2013","isbn":"9781450322638","key":"Akiba2013","keywords":"all or part of,cohesive subgraphs,connectivity,graphs,maximal k -edge-connected subgraph,or,or hard copies of,permission to make digital,random contraction,this work for personal,vertex clusters","month":"October","pages":"909--918","publisher":"ACM Press","title":"Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction","type":"inproceedings","url":"http://dl.acm.org/citation.cfm?id=2505515.2505751 http://dl.acm.org/citation.cfm?doid=2505515.2505751","year":"2013","bibbaseid":"akiba-iwata-yoshida-lineartimeenumerationofmaximalkedgeconnectedsubgraphsinlargenetworksbyrandomcontraction-2013","role":"author","urls":{"Paper":"http://dl.acm.org/citation.cfm?id=2505515.2505751 http://dl.acm.org/citation.cfm?doid=2505515.2505751"},"keyword":["all or part of","cohesive subgraphs","connectivity","graphs","maximal k -edge-connected subgraph","or","or hard copies of","permission to make digital","random contraction","this work for personal","vertex clusters"],"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-16T08:51:59.121Z","downloads":0,"keywords":["all or part of","cohesive subgraphs","connectivity","graphs","maximal k -edge-connected subgraph","or","or hard copies of","permission to make digital","random contraction","this work for personal","vertex clusters"],"search_terms":["linear","time","enumeration","maximal","edge","connected","subgraphs","large","networks","random","contraction","akiba","iwata","yoshida"],"title":"Linear-time enumeration of maximal K-edge-connected subgraphs in large networks by random contraction","year":2013,"dataSources":["YRMeqhMHoNu9HzJoC"]}