Bitte melden Sie sich an um selbst Rezensionen oder Kommentare zu erstellen.
Zitieren Sie diese Publikation
Mehr Zitationsstile
- bitte auswählen -
%0 Conference Paper
%1 Kumar07
%A Kumar, Ravi
%A Tomkins, Andrew
%A Vee, Erik
%B WSDM '08: Proceedings of the international conference on Web search and web data mining
%C New York, NY, USA
%D 2008
%I ACM
%K bipartite bit connectivity core graph structure
%P 129--138
%R http://doi.acm.org/10.1145/1341531.1341550
%T Connectivity structure of bipartite graphs via the KNC-plot
%U http://portal.acm.org/citation.cfm?doid=1341531.1341550
%@ 978-1-59593-927-9
@inproceedings{Kumar07,
added-at = {2019-06-07T11:34:18.000+0200},
address = {New York, NY, USA},
author = {Kumar, Ravi and Tomkins, Andrew and Vee, Erik},
biburl = {https://www.bibsonomy.org/bibtex/25090526b8f22cc041a047634c6a33e4d/johirth},
booktitle = {WSDM '08: Proceedings of the international conference on Web search and web data mining},
description = {Connectivity structure of bipartite graphs via the KNC-plot},
doi = {http://doi.acm.org/10.1145/1341531.1341550},
interhash = {fbb2645aaf3c55f0f479473a4468c672},
intrahash = {5090526b8f22cc041a047634c6a33e4d},
isbn = {978-1-59593-927-9},
keywords = {bipartite bit connectivity core graph structure},
location = {Palo Alto, California, USA},
pages = {129--138},
publisher = {ACM},
timestamp = {2019-06-07T11:34:18.000+0200},
title = {Connectivity structure of bipartite graphs via the KNC-plot},
url = {http://portal.acm.org/citation.cfm?doid=1341531.1341550},
year = 2008
}