%0 Conference Paper %1 kumar2008 %A Kumar, R. %A Tomkins, A. %A Vee, E. %B Proceedings of the Conference on Web Search and Data Mining, WSDM 2008 %D 2008 %E Najork, Marc %E Broder, Andrei Z. %E Chakrabarti, Soumen %I ACM %K graphs networks %P 129-138 %T Connectivity structure of bipartite graphs via the KNC-plot %U http://dblp.uni-trier.de/db/conf/wsdm/wsdm2008.html#KumarTV08

@inproceedings{kumar2008, added-at = {2008-03-17T14:35:03.000+0100}, author = {Kumar, R. and Tomkins, A. and Vee, E.}, biburl = {https://www.bibsonomy.org/bibtex/2bafb21665037f91941fce9731cb7bb55/mstrohm}, booktitle = {Proceedings of the Conference on Web Search and Data Mining, WSDM 2008}, crossref = {conf/wsdm/2008}, date = {2008-02-18}, description = {introduces an algorithm to compute KNC (k-neighbor connectivity) plots}, editor = {Najork, Marc and Broder, Andrei Z. and Chakrabarti, Soumen}, ee = {http://doi.acm.org/10.1145/1341531.1341550}, interhash = {fbb2645aaf3c55f0f479473a4468c672}, intrahash = {bafb21665037f91941fce9731cb7bb55}, keywords = {graphs networks}, pages = {129-138}, publisher = {ACM}, timestamp = {2008-03-17T14:35:03.000+0100}, title = {Connectivity structure of bipartite graphs via the KNC-plot}, url = {http://dblp.uni-trier.de/db/conf/wsdm/wsdm2008.html#KumarTV08}, year = 2008 }