On the public citation graph

Network Motif Discovery: A GPU Approach

https://doi.org/10.1109/tkde.2016.2566618

0 signed · 105 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11557067_14openalex-snapshot

A Faster Algorithm for Detecting Network Motifs

inferredcites →https://doi.org/10.1007/3-540-60793-5_91openalex-snapshot

Subgraph isomorphism detection in polynomial time on preprocessed model graphs

inferredcites →https://doi.org/10.1007/978-3-540-71681-5_7openalex-snapshot

Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking

inferredcites →https://doi.org/10.1007/978-3-540-74446-7_8openalex-snapshot

An Algorithm Portfolio for the Sub-graph Isomorphism Problem

inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot

Isomorphism of graphs of bounded valence can be tested in polynomial time

inferredcites →https://doi.org/10.1016/j.jpdc.2008.05.012openalex-snapshot

Fast parallel GPU-sorting using a hybrid algorithm

inferredcites →https://doi.org/10.1016/j.jpdc.2011.08.007openalex-snapshot

Parallel discovery of network motifs

inferredcites →https://doi.org/10.1016/j.jsc.2013.09.003openalex-snapshot

Practical graph isomorphism, II

inferredcites →https://doi.org/10.1016/j.tree.2006.05.013openalex-snapshot

Are network motifs the spandrels of cellular complexity?

inferredcites →https://doi.org/10.1017/s0269888912000331openalex-snapshot

A survey of frequent subgraph mining algorithms

inferredcites →https://doi.org/10.1038/ng881openalex-snapshot

Network motifs in the transcriptional regulation network of Escherichia coli

inferredcites →https://doi.org/10.1093/bioinformatics/bth163openalex-snapshot

Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs

inferredcites →https://doi.org/10.1093/bioinformatics/bth402openalex-snapshot

Conserved network motifs allow protein–protein interaction prediction

inferredcites →https://doi.org/10.1093/bioinformatics/btl038openalex-snapshot

FANMOD: a tool for fast network motif detection

inferredcites →https://doi.org/10.1093/bioinformatics/btn163openalex-snapshot

Biomolecular network motif counting and discovery by color coding

inferredcites →https://doi.org/10.1103/physreve.71.016127openalex-snapshot

Coarse-graining and self-dissimilarity of complex networks

inferredcites →https://doi.org/10.1109/bibe.2005.8openalex-snapshot

A Parallel Algorithm for Extracting Transcription Regulatory Network Motifs

inferredcites →https://doi.org/10.1109/e-science.2009.20openalex-snapshot

Strategies for Network Motifs Discovery

inferredcites →https://doi.org/10.1109/icde.2009.133openalex-snapshot

GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases

inferredcites →https://doi.org/10.1109/icde.2013.6544814openalex-snapshot

Enumerating subgraph instances using map-reduce

inferredcites →https://doi.org/10.1109/icde.2014.6816705openalex-snapshot

Large-scale frequent subgraph mining in MapReduce

inferredcites →https://doi.org/10.1109/icde.2015.7113337openalex-snapshot

Network motif discovery: A GPU approach

inferredcites →https://doi.org/10.1109/icdm.2002.1184038openalex-snapshot

gSpan: graph-based substructure pattern mining

inferredcites →https://doi.org/10.1109/icdm.2006.79openalex-snapshot

GraphRank: Statistical Modeling and Mining of Significant Subgraphs in the Feature Space

inferredcites →https://doi.org/10.1109/icdm.2008.109openalex-snapshot

Mining Large Networks with Subgraph Counting

inferredcites →https://doi.org/10.1109/iciap.1999.797762openalex-snapshot

Performance evaluation of the VF graph matching algorithm

inferredcites →https://doi.org/10.1109/icpp.2010.67openalex-snapshot

Subgraph Enumeration in Large Social Contact Networks Using Parallel Color Coding and Streaming

inferredcites →https://doi.org/10.1109/tcbb.2006.51openalex-snapshot

Efficient Detection of Network Motifs

inferredcites →https://doi.org/10.1109/tpami.2004.75openalex-snapshot

A (sub)graph isomorphism algorithm for matching large graphs

inferredcites →https://doi.org/10.1126/science.298.5594.824openalex-snapshot

Network Motifs: Simple Building Blocks of Complex Networks

inferredcites →https://doi.org/10.1145/1150402.1150418openalex-snapshot

NeMoFinder

inferredcites →https://doi.org/10.1145/1376616.1376662openalex-snapshot

Mining significant graph patterns by leap search

inferredcites →https://doi.org/10.1145/1565694.1565702openalex-snapshot

Frequent itemset mining on graphics processors

inferredcites →https://doi.org/10.1145/1774088.1774422openalex-snapshot

g-tries

inferredcites →https://doi.org/10.1145/1964179.1964184openalex-snapshot

Reducing branch divergence in GPU programs

inferredcites →https://doi.org/10.1145/2396761.2396805openalex-snapshot

Efficient algorithms for generalized subgraph query processing

inferredcites →https://doi.org/10.1145/2588555.2588557openalex-snapshot

Parallel subgraph listing in a large-scale graph

inferredcites →https://doi.org/10.1145/321921.321925openalex-snapshot

An Algorithm for Subgraph Isomorphism

inferredcites →https://doi.org/10.1145/800061.808746openalex-snapshot

Canonical labeling of graphs

inferredcites →https://doi.org/10.1186/1471-2105-10-318openalex-snapshot

Kavosh: a new algorithm for finding network motifs

inferredcites →https://doi.org/10.1266/ggs.84.385openalex-snapshot

MODA: An efficient algorithm for network motif discovery in biological networks

inferredcites →https://doi.org/10.1371/journal.pbio.0020369openalex-snapshot

Motifs in Brain Networks

inferredcites →https://doi.org/10.1371/journal.pone.0050093openalex-snapshot

NetMODE: Network Motif Detection without Nauty

inferredcites →https://doi.org/10.1371/journal.pone.0068073openalex-snapshot

QuateXelero: An Accelerated Exact Network Motif Detection Algorithm

inferredcites →https://doi.org/10.14778/1453856.1453899openalex-snapshot

Taming verification hardness

inferredcites →https://doi.org/10.7939/r3sx64c5kopenalex-snapshot

The Graph Isomorphism Problem

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4641405openalex-extracted

inferred← citeshttps://doi.org/10.1002/cpe.5645openalex-snapshot

Discovering multi‐dimensional motifs from multi‐dimensional time series for air pollution control

inferred← citeshttps://doi.org/10.1002/int.22980openalex-snapshot

GHOC: A generative model for hybrid‐order community detection

inferred← citeshttps://doi.org/10.1007/978-981-13-9942-8_8openalex-snapshot

Network Motifs: A Survey

inferred← citeshttps://doi.org/10.1007/s11227-017-2225-1openalex-snapshot

A survey of graph processing on graphics processing units

inferred← citeshttps://doi.org/10.1007/s13278-015-0256-2openalex-snapshot

Rand-FaSE: fast approximate subgraph census

inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100247openalex-snapshot

Big networks: A survey

inferred← citeshttps://doi.org/10.1016/j.cosrev.2020.100267openalex-snapshot

Motif discovery in networks: A survey

inferred← citeshttps://doi.org/10.1016/j.neunet.2025.107406openalex-snapshot

Motif and supernode-enhanced gated graph neural networks for session-based recommendation

inferred← citeshttps://doi.org/10.1016/j.patter.2023.100839openalex-snapshot

EasyGraph: A multifunctional, cross-platform, and effective library for interdisciplinary network analysis

inferred← citeshttps://doi.org/10.1016/j.physa.2025.131096openalex-snapshot

A generalized motif-based Naïve Bayes model for sign prediction in complex networks

inferred← citeshttps://doi.org/10.1016/j.physleta.2021.127829openalex-snapshot

Extreme vulnerability of high-order organization in complex networks

inferred← citeshttps://doi.org/10.1016/j.ymeth.2019.07.008openalex-snapshot

FSM: Fast and scalable network motif discovery for exploring higher-order network organizations

inferred← citeshttps://doi.org/10.1049/iet-syb.2019.0008openalex-snapshot

Disjoint motif discovery in biological network using pattern join method

inferred← citeshttps://doi.org/10.1049/iet-syb.2020.0004openalex-snapshot

Review of tools and algorithms for network motif discovery in biological networks

inferred← citeshttps://doi.org/10.1080/10618600.2017.1391696openalex-snapshot

An Efficient Sampling Algorithm for Network Motif Detection

inferred← citeshttps://doi.org/10.1093/comnet/cnac051openalex-snapshot

BFS-based distributed algorithm for parallel local-directed subgraph enumeration

inferred← citeshttps://doi.org/10.1101/308254openalex-snapshot

Discovery of Large Disjoint Motif in Biological Network using Dynamic Expansion Tree

inferred← citeshttps://doi.org/10.1101/411520openalex-snapshot

Identifying Representative Network Motifs for Inferring Higher-order Structure of Biological Networks

inferred← citeshttps://doi.org/10.1109/access.2019.2908226openalex-snapshot

A Super Point Detection Algorithm Under Sliding Time Windows Based on Rough and Linear Estimators

inferred← citeshttps://doi.org/10.1109/access.2019.2960044openalex-snapshot

Motifs in Big Networks: Methods and Applications

inferred← citeshttps://doi.org/10.1109/bibm.2018.8621565openalex-snapshot

Identifying Representative Network Motifs for Inferring Higher-order Structure of Biological Networks

inferred← citeshttps://doi.org/10.1109/icde.2019.00125openalex-snapshot

RUM: Network Representation Learning Using Motifs

inferred← citeshttps://doi.org/10.1109/icde55515.2023.00309openalex-snapshot

Exploiting Reuse for GPU Subgraph Enumeration (Extended Abstract)

inferred← citeshttps://doi.org/10.1109/icde60146.2024.00247openalex-snapshot

Accelerating Biclique Counting on GPU

inferred← citeshttps://doi.org/10.1109/icde60146.2024.00248openalex-snapshot

GPU-Accelerated Batch-Dynamic Subgraph Matching

inferred← citeshttps://doi.org/10.1109/icde65706.2026.00225openalex-snapshot

C 2 graph: A Compression-Collaboration Algorithm for CPU-GPU Hybrid Weighted Graph Traversals

inferred← citeshttps://doi.org/10.1109/micro50266.2020.00077openalex-snapshot

A Locality-Aware Energy-Efficient Accelerator for Graph Mining Applications

inferred← citeshttps://doi.org/10.1109/mis.2020.3042871openalex-snapshot

How to Optimize an Academic Team When the Outlier Member is Leaving?

inferred← citeshttps://doi.org/10.1109/pact52795.2021.00030openalex-snapshot

SumPA: Efficient Pattern-Centric Graph Mining with Pattern Abstraction

inferred← citeshttps://doi.org/10.1109/pact58117.2023.00022openalex-snapshot

Parallelizing Maximal Clique Enumeration on GPUs

inferred← citeshttps://doi.org/10.1109/sbac-pad55451.2022.00022openalex-snapshot

Efficient Strategies for Graph Pattern Mining Algorithms on GPUs

inferred← citeshttps://doi.org/10.1109/sc41404.2022.00058openalex-snapshot

STMatch: Accelerating Graph Pattern Matching on GPU with Stack-Based Loop Optimizations

inferred← citeshttps://doi.org/10.1109/tcyb.2021.3125227openalex-snapshot

Higher Order Connection Enhanced Community Detection in Adversarial Multiview Networks

inferred← citeshttps://doi.org/10.1109/tifs.2023.3272731openalex-snapshot

Motif-Level Anomaly Detection in Dynamic Graphs

inferred← citeshttps://doi.org/10.1109/tkde.2019.2904969openalex-snapshot

Blocking Self-Avoiding Walks Stops Cyber-Epidemics: A Scalable GPU-Based Approach

inferred← citeshttps://doi.org/10.1109/tkde.2019.2940184openalex-snapshot

Automatic Irregularity-Aware Fine-Grained Workload Partitioning on Integrated Architectures

inferred← citeshttps://doi.org/10.1109/tkde.2019.2956532openalex-snapshot

HM-Modularity: A Harmonic Motif Modularity Approach for Multi-Layer Network Community Detection

inferred← citeshttps://doi.org/10.1109/tkde.2020.3035564openalex-snapshot

Exploiting Reuse for GPU Subgraph Enumeration

inferred← citeshttps://doi.org/10.1109/tkde.2021.3117842openalex-snapshot

Hybrid-Order Anomaly Detection on Attributed Networks

inferred← citeshttps://doi.org/10.1109/tkde.2023.3336329openalex-snapshot

Large-Scale Graph Label Propagation on GPUs

inferred← citeshttps://doi.org/10.1109/tpds.2025.3582996openalex-snapshot

$\text {GPUSCAN}^{++}$: Efficient Structural Graph Clustering on GPUs

inferred← citeshttps://doi.org/10.1145/3308558.3313555openalex-snapshot

Distributed Algorithms for Fully Personalized PageRank on Large Graphs

inferred← citeshttps://doi.org/10.1145/3378537openalex-snapshot

Community Detection by Motif-Aware Label Propagation

inferred← citeshttps://doi.org/10.1145/3448016.3452774openalex-snapshot

GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection

inferred← citeshttps://doi.org/10.1145/3448016.3457279openalex-snapshot

Self-adaptive Graph Traversal on GPUs

inferred← citeshttps://doi.org/10.1145/3524059.3532382openalex-snapshot

Parallel K-clique counting on GPUs

inferred← citeshttps://doi.org/10.1145/3589326openalex-snapshot

Efficient GPU-Accelerated Subgraph Matching

inferred← citeshttps://doi.org/10.1145/3616855.3635788openalex-snapshot

DeSCo: Towards Generalizable and Scalable Deep Subgraph Counting

inferred← citeshttps://doi.org/10.1145/3786648openalex-snapshot

Enumerating Graph Pattern Matches with ML Oracles

inferred← citeshttps://doi.org/10.1145/3802577openalex-snapshot

Accelet: Hardware-software Co-design of Chiplet-based DNN Accelerators

inferred← citeshttps://doi.org/10.1186/s12859-018-2483-9openalex-snapshot

Optimising orbit counting of arbitrary order by equation selection

inferred← citeshttps://doi.org/10.14778/3632093.3632118openalex-snapshot

MOSER: Scalable Network Motif Discovery Using Serial Test

inferred← citeshttps://doi.org/10.14778/3705829.3705856openalex-snapshot

Themis: A GPU-Accelerated Relational Query Execution Engine

inferred← citeshttps://doi.org/10.14778/3836663.3836711openalex-snapshot

Efficient GPU-Accelerated Local Subgraph Counting

inferred← citeshttps://doi.org/10.1613/jair.1.12061openalex-snapshot

Hybrid-order Network Consensus for Distributed Multi-agent Systems

inferred← citeshttps://doi.org/10.3724/bnsfc-2024.12.12.0001openalex-snapshot

Modelling Methods，Applications and Perspectives on Higher-order Relationships

inferred← citeshttps://doi.org/10.70675/24cfd0f4zaa30z4382z92c0ze696126ad6f0openalex-snapshot

Parallel and distributed algorithms for pattern matching in big graphs

inferred← citeshttps://doi.org/10.7717/peerj.6917openalex-snapshot

Application of dynamic expansion tree for finding large network motifs in biological networks

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.