The DOI matches its Crossref record; 28 of the 28 references it cites were found in a registry or an index.
Truss decomposition in massive networks
Open accessAbstract
The k -truss is a type of cohesive subgraphs proposed recently for the study of networks. While the problem of computing most cohesive subgraphs is NP-hard, there exists a polynomial time algorithm for computing k -truss. Compared with k -core which is also efficient to compute, k -truss represents the "core" of a k -core that keeps the key information of, while filtering out less important information from, the k -core. However, existing algorithms for computing k -truss are inefficient for handling today's massive networks. We first improve the existing in-memory algorithm for computing k -truss in networks of moderate size. Then, we propose two I/O-efficient algorithms to handle massive networks that cannot fit in main memory. Our experiments on real datasets verify the efficiency of our algorithms and the value of k -truss.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Collective dynamics of ‘small-world’ networks
Watts, D. J., & Strogatz, S. H. (1998) · Nature · doi:10.1038/30918 · Cited by 43,060
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,993
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Introduction to Social Network Methods
Hanneman, R. A. (2001) · Cited by 3,956
Algorithm 457: finding all cliques of an undirected graph
Bron, C., & Kerbosch, J. (1973) · Communications of the ACM · doi:10.1145/362342.362367 · Cited by 2,452
Network structure and minimum degree
Seidman, S. B. (1983) · Social Networks · doi:10.1016/0378-8733(83)90028-x · Cited by 1,891
Random graph models of social networks
Newman, M. E. J., Watts, D. J., & Strogatz, S. H. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.012582999 · Cited by 1,326
Krackhardt, D. (1987) · Social Networks · doi:10.1016/0378-8733(87)90009-8 · Cited by 1,066
A Method of Matrix Analysis of Group Structure
Luce, R. D., & Perry, A. D. (1949) · Psychometrika · doi:10.1007/bf02289146 · Cited by 983
A model of Internet topology using k-shell decomposition
Carmi, S., Havlin, S., Kirkpatrick, S., Shavitt, Y., & Shir, E. (2007) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0701175104 · Cited by 760
An O(m) Algorithm for Cores Decomposition of Networks
Batagelj, V., & Zaveršnik, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0310049 · Cited by 627
A graph‐theoretic generalization of the clique concept
Seidman, S. B., & Foster, B. L. (1978) · Journal of Mathematical Sociology · doi:10.1080/0022250x.1978.9989883 · Cited by 464
Main-memory triangle computations for very large (sparse (power-law)) graphs
Latapy, M. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.07.017 · Cited by 458
Counting triangles and the curse of the last reducer
Suri, S., & Vassilvitskii, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963491 · Cited by 408
Mokken, R. J. (1979) · Quality & Quantity · doi:10.1007/bf00139635 · Cited by 374
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
Eppstein, D., Löffler, M., & Strash, D. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-17517-6_36 · Cited by 356
Connectivity and Generalized Cliques in Sociometric Group Structure
Luce, R. D. (1950) · Psychometrika · doi:10.1007/bf02289199 · Cited by 343
Massive Quasi-Clique Detection
Abello, J., Resende, M. G. C., & Sudarsky, S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45995-2_51 · Cited by 331
Large scale networks fingerprinting and visualization using the k-core decomposition
Alvarez-Hamelin, J. I., Dall’Asta, L., Barrat, A., & Vespignani, A. (2005) · Cited by 295
Efficient core decomposition in massive networks
Cheng, J., Ke, Y., Chu, S., & Ozsu, M. T. (2011) · 2011 IEEE 27th International Conference on Data Engineering · doi:10.1109/icde.2011.5767911 · Cited by 266
Self-citationOn mining cross-graph quasi-cliques
Pei, J., Jiang, D., & Zhang, A. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081898 · Cited by 246
Finding maximal cliques in massive networks
Cheng, J. S.-C., Ke, Y., Fu, A. W.-C., et al. (2011) · ACM Transactions on Database Systems · doi:10.1145/2043652.2043654 · Cited by 160
Self-citationTriangle listing in massive networks and its applications
Chu, S., & Cheng, J. S.-C. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020513 · Cited by 143
Self-citationAlgorithmic Aspects of Triangle-Based Network Analysis
Schank, T. (2007) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/1000007159 · Cited by 119
Classifying molecular sequences using a linkage graph with their pairwise similarities
Matsuda, H., Ishihara, T., & Hashimoto, A. (1999) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00091-7 · Cited by 116
Finding maximal cliques in massive networks by H*-graph
Cheng, J. S.-C., Ke, Y., Fu, A. W.-C., et al. (2010) · Proceedings - ACM-SIGMOD International Conference on Management of Data · doi:10.1145/1807167.1807217 · Cited by 104
Self-citationTriangle listing in massive networks
Chu, S., & Cheng, J. S.-C. (2012) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2382577.2382581 · Cited by 96
Self-citationBatagelj, V., & Zaveršnik, M. (2006) · Discrete Mathematics · doi:10.1016/j.disc.2005.09.051 · Cited by 61
Cited by
Querying k-truss community in large and dynamic graphs
Huang, X., Cheng, H., Qin, L., Tian, W., & Yu, J. X. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2610495 · Cited by 488
Structure and dynamics of core/periphery networks
Csermely, P., London, A., Wu, L.-Y., & Uzzi, B. (2013) · Journal of Complex Networks · doi:10.1093/comnet/cnt016 · Cited by 367
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
Metadata
- Authors
- Wang, J., & Cheng, J.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2012-05
- Volume
- 5
- Issue
- 9
- Pages
- 812-823
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W2023536175
- Cited by
- 423
- References
- 28
- FWCI
- 13.11
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.