|
Volumn 381, Issue 1-2, 2007, Pages 482-490
|
An optimal algorithm for counting network motifs
|
Author keywords
Algorithm; Graph; Motif; Networks
|
Indexed keywords
COMPUTER NETWORKS;
GRAPH THEORY;
OPTIMAL SYSTEMS;
DEGREE DISTRIBUTION;
MICROSCOPIC DETAILS;
NETWORK MOTIFS;
OPTIMAL ALGORITHM;
ALGORITHMS;
|
EID: 34249744698
PISSN: 03784371
EISSN: None
Source Type: Journal
DOI: 10.1016/j.physa.2007.02.102 Document Type: Article |
Times cited : (44)
|
References (15)
|