D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 721--732. VLDB Endowment, 2005. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Link-Based Characterization and Detection of Web Spam - Becchetti, Castillo.. (2006) (1 citation) (Correct)
No context found.
D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 721--732. VLDB Endowment, 2005.
Using Rank Propagation and Probabilistic Counting.. - Becchetti.. (2006) (Correct)
No context found.
D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB '05: Proceedings of the 31st international conference on Very large data bases, pages 721--732. VLDB Endowment, 2005.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC