The DOI matches its Crossref record.
A combinatorial approach to graphlet counting
Abstract
Motivation: Small-induced subgraphs called graphlets are emerging as a possible tool for exploration of global and local structure of networks and for analysis of roles of individual nodes. One of the obstacles to their wider use is the computational complexity of algorithms for their discovery and counting. Results: We propose a new combinatorial method for counting graphlets and orbit signatures of network nodes. The algorithm builds a system of equations that connect counts of orbits from graphlets with up to five nodes, which allows to compute all orbit counts by enumerating just a single one. This reduces its practical time complexity in sparse graphs by an order of magnitude as compared with the existing pure enumeration-based algorithms. Availability and implementation: Source code is available freely at http://www.biolab.si/supp/orca/orca.html. Contact: tomaz.hocevar@fri.uni-lj.si Supplementary information: Supplementary data are available at Bioinformatics online.
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
Cited by
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
Comparing methods for comparing networks
Tantardini, M., Ieva, F., Tajoli, L., & Piccardi, C. (2019) · Scientific Reports · doi:10.1038/s41598-019-53708-y · Cited by 264
Integrated interactions database: tissue-specific view of the human and model organism interactomes
Kotlyar, M., Pastrello, C., Sheahan, N., & Jurisica, I. (2016) · Nucleic Acids Research · doi:10.1093/nar/gkv1115 · Cited by 254
Motif-Backdoor: Rethinking the Backdoor Attack on Graph Neural Networks via Motifs
Zheng, H., Xiong, H., Chen, J., Ma, H., & Huang, G. (2024) · IEEE Transactions on Computational Social Systems · doi:10.1109/tcss.2023.3267094 · Cited by 41
Metadata
- Authors
- Hočevar, T., & Demšar, J.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2014-02-15
- Volume
- 30
- Issue
- 4
- Pages
- 559-565
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2157312249
- Cited by
- 214
- References
- 0
- FWCI
- 12.27
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A combinatorial approach to graphlet counting. https://app.cochat.ai/papers/10.1093/bioinformatics/btt717
- The paper
- Hočevar, T., & Demšar, J. (2014). A combinatorial approach to graphlet counting. Bioinformatics. https://doi.org/10.1093/bioinformatics/btt717
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.