The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Main-memory triangle computations for very large (sparse (power-law)) graphs
Open accessOverview
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Graphs over time: densification laws, shrinking diameters and possible explanations
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081893 · Cited by 2,281
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Introduction to Algorithms, Second Edition
Rivest, R. L., Leiserson, C. E., Cormen, T. H., & Stein, C. (2001) · Cited by 1,984
Breakdown of the Internet under Intentional Attack
Cohen, R., Erez, K., ben-Avraham, D., & Havlin, S. (2001) · Physical Review Letters · doi:10.1103/physrevlett.86.3682 · Cited by 1,455
Pajek - Program for Large Network Analysis
Batagelj, V., & Mrvar, A. (1999) · Cited by 1,455
The webgraph framework I: compression techniques
Boldi, P., & Vigna, S. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988752 · Cited by 1,201
Handbook of Graphs and Networks: From the Genome to the Internet
(2002) · Wiley eBooks · doi:10.1002/3527602755 · Cited by 949
Yang, X.-S. (2021) · Nature-Inspired Optimization Algorithms · doi:10.1016/b978-0-12-821986-7.00008-1 · Cited by 677
(2005) · Lecture Notes in Computer Science · doi:10.1007/b106453 · Cited by 636
Finding and counting given length cycles
Alon, N., Yuster, R., & Zwick, U. (1997) · Algorithmica · doi:10.1007/bf02523189 · Cited by 608
UbiCrawler: a scalable fully distributed Web crawler
Boldi, P., Codenotti, B., Santini, M., & Vigna, S. (2004) · Software: Practice and Experience · doi:10.1002/spe.587 · Cited by 560
Yeger-Lotem, E., Sattath, S., Kashtan, N., Itzkovitz, S., Milo, R., Pinter, R. Y., Alon, U., & Margalit, H. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0306752101 · Cited by 536
Mathematical results on scale‐free random graphs
Bollobás, B., & Riordan, O. M. (2002) · Handbook of Graphs and Networks · doi:10.1002/3527602755.ch1 · Cited by 463
Henzinger, M., Raghavan, P., & Rajagopalan, S. (1999) · DIMACS Series in Discrete Mathematics and Theoretical Computer Science · doi:10.1090/dimacs/050/05 · Cited by 418
Finding a Minimum Circuit in a Graph
Itai, A., & Rodeh, M. (1978) · SIAM Journal on Computing · doi:10.1137/0207033 · Cited by 391
Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
Schank, T., & Wagner, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/11427186_54 · Cited by 319
Approximating Clustering Coefficient and Transitivity
Schank, T., & Wagner, D. (2005) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00108 · Cited by 274
Structure and time evolution of an Internet dating community
Holme, P., Edling, C., & Liljeros, F. (2004) · Lund University Publications (Lund University) · Cited by 247
Structure and time evolution of an Internet dating community
Holme, P., Edling, C. R., & Liljeros, F. (2004) · Social Networks · doi:10.1016/j.socnet.2004.01.007 · Cited by 222
Structural and Algorithmic Aspects of Massive Social Networks
Eubank, S., Anil, V. S., Madhav, K., Marathe, V., Srinivasan, A., & Wang, N. (2004) · Cited by 148
Complex Network Measurements: Estimating the Relevance of Observed Properties
Matthieu Latapy, B., & Magnien, C. (2008) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2008.227 · Cited by 70
Detecting short directed cycles using rectangular matrix multiplication and dynamic programming
Yuster, R., & Zwick, U. (2004) · doi:10.5555/982792.982828 · Cited by 62
Comment on “Breakdown of the Internet under Intentional Attack”
Dorogovtsev, S. N., & Mendes, J. F. F. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.219801 · Cited by 47
Matrix measures for transitivity and balance*
Harary, F., & Kommel, H. J. (1979) · Journal of Mathematical Sociology · doi:10.1080/0022250x.1979.9989889 · Cited by 40
Fast Sparse Matrix Multiplication
Yuster, R., & Zwick, U. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30140-0_54 · Cited by 33
Measuring Fundamental Properties of Real-World Complex NetworksPreprint
Matthieu Latapy, B., & Magnien, C. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0609115 · Cited by 27
Homomorphisms in Graph Property Testing - A SurveyPreprint
Shapira, A., & Alon, N. (2005) · Electronic colloquium on computational complexity · Cited by 15
Cited by
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
Paranjape, A., Benson, A. R., & Leskovec, J. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018731 · Cited by 540
Truss decomposition in massive networks
Wang, J., & Cheng, J. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2311906.2311909 · Cited by 423
Metadata
- Authors
- Latapy, M.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2008-11
- Volume
- 407
- Issue
- 1-3
- Pages
- 458-473
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2016311778
- Cited by
- 458
- References
- 31
- FWCI
- 10.98
- Type
- journal article
- Language
- en
- Open access
- bronze
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.