%0 Journal Article %1 Hartuv2000 %A Hartuv, Erez %A Shamir, Ron %D 2000 %I Elsevier %J Inf. Process. Lett. %K algorithms clustering diameter graph_connectivity minimum_cut phd %N 4-6 %P 175--181 %T A clustering algorithm based on graph connectivity %U http://www.sciencedirect.com/science/article/pii/S0020019000001423 %V 76

@article{Hartuv2000, added-at = {2013-12-17T10:08:37.000+0100}, author = {Hartuv, Erez and Shamir, Ron}, biburl = {https://www.bibsonomy.org/bibtex/2cc6b040013e788afc00ebdc301598b88/jullybobble}, file = {:Users/julien.gaugaz/Dropbox/Papers/Mendeley Desktop/2000/Hartuv, Shamir - 2000 - A clustering algorithm based on graph connectivity.pdf:pdf}, interhash = {9b3accb72e5a8862727e1926d4f6bc4e}, intrahash = {cc6b040013e788afc00ebdc301598b88}, journal = {Inf. Process. Lett.}, keywords = {algorithms clustering diameter graph_connectivity minimum_cut phd}, number = {4-6}, pages = {175--181}, publisher = {Elsevier}, timestamp = {2014-07-27T15:43:19.000+0200}, title = {{A clustering algorithm based on graph connectivity}}, url = {http://www.sciencedirect.com/science/article/pii/S0020019000001423}, volume = 76, year = 2000 }