Connectivity structure of bipartite graphs via the KNC-plot.
Ravi Kumar|Andrew Tomkins|Erik Vee
| Anthology ID: | DBLP:conf/wsdm/KumarTV08 |
|---|---|
| Volume: | Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008 |
| Year: | 2008 |
| Venue: | Web Search and Data Mining (WSDM) |
| Publisher: | ACM |
| Pages: | 129-138 |
| URL: | https://doi.org/10.1145/1341531.1341550 |
| DOI: | https://doi.org/10.1145/1341531.1341550 |
| DBLP: | conf/wsdm/KumarTV08 |
| BibTeX: |
@inproceedings{kumar-2008-connectivity,
author = {Ravi Kumar and
Andrew Tomkins and
Erik Vee},
editor = {Marc Najork and
Andrei Z. Broder and
Soumen Chakrabarti},
title = {{Connectivity structure of bipartite graphs via the KNC-plot}},
booktitle = {{Proceedings of the International Conference on Web Search and Web Data Mining, WSDM 2008, Palo Alto, California, USA, February 11-12, 2008}},
pages = {129--138},
publisher = {ACM},
year = {2008},
url = {https://doi.org/10.1145/1341531.1341550},
doi = {https://doi.org/10.1145/1341531.1341550}
}