On triangulation-based dense neighborhood graph discovery

Proceedings of the VLDB Endowment

Volumn 4, Issue 2, 2010, Pages 58-68

  Wang, Nan ^a   Zhang, Jingbo ^a   Tan, Kian Lee ^a   Tung, Anthony K H ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

SURVEYING; TRIANGULATION;

CONNECTED SUBGRAPHS; DENSE SUBGRAPH; NEIGHBORHOOD GRAPHS; PERFORMANCE STUDY; SMALL MEMORY FOOTPRINT; STATE OF THE ART; TRIANGULATION METHOD; TRIANGULATION-BASED;

ITERATIVE METHODS;

EID: 80052664153     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1921071.1921073     Document Type: Article

References (16)

1. Netflix Prize Data Set, 2009 (accessed July 23, 2009).
2. J. Abello, M. Resende, and R. Sudarsky. Massive quasi-clique detection. In Proc. 5th Latin American Symposium on Theoretical Informatics, pages 598-612, 2002.
3. I. Akihiro, W. Takashi, and M. Hiroshi. Complete mining of frequent patterns from graphs: Mining graph data. Machine Learning, 50(3):321-354, 2003.
4. P. Aloy, B. Bãpttcher, H. Ceulemans, C. Leutwein, C. Mellwig, S. Fischer, A. C. Gavin, P. Bork, S. G. Furga, L. Serrano, and R. D. Russell. Structure-based assembly of protein complexes in yeast. Science, 303(5666):2026-2029, 2004.
5. L. Becchetti, P. Boldi, C. Castillo, and A. Gionis. Efficient semi-streaming algorithms for local triangle counting in massive graphs. In ACM KDD '08, pages 16-24, New York, NY, USA, 2008.
6. V. Boginski, S. Butenko, and P. Pardalos. Mining market data: a network approach. Computer Operational Research, 33(11):3171-3184, 2006.
7. M. Brockington and J. Culberson. Camouflaging independent sets in quasi-random graphs. DIMACS Series, 26:75-88, 1994.
8. D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB'05, pages 721-732, 2005.
9. J. Han, N. Stefanovic, and K. Koperski. Selective materialization: An efficient method for spatial data cube construction. In PAKDD'98 [Lecture Notes in Artificial Intelligence, 1394, Springer Verlag, 1998], pages 144-158, 1998.
10. H. Hu, X. Yan, Y. Huang, J. Han, and X. Zhou. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics, 21:213-221, 2005.
11. C. F. J. Rivas. Proteincprotein interactions essentials: Key concepts to building and analyzing interactome networks. PLoS Computational Biology, 6:6, 2010.
12. R. Karp. Reducibility among combinatorial problems. The Journal of Symbolic Logic, 40:618-619, 1975.
13. M. Latapy. Practical algorithms for triangle computations in very large (sparse (power-law)) graphs. Journal of Theoretical Computer Science, 407:458-473, 2008.
14. T. Schank and D. Wagner. Finding, counting and listing all triangles in large graphs, an experimental study. In WEA, pages 606-609, 2005.
15. N. Wang, S. Parthasarathy, K. L. Tan, and A. Tung. Csv: visualizing and mining cohesive subgraphs. In SIGMOD'08, pages 445-458, 2008.
16. I. Xenarios and Łukasz Salwínski etc. DIP, the database of interacting proteins: A research tool for studying cellular networks of protein interactions. Nucleic Acids Research, 30(1):303-305, 2002.