相关参考文献
注意:仅列出部分参考文献,下载原文获取全部文献信息。The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration
Maarten Houbraken et al.
PLOS ONE (2014)
Overlapping Communities Explain Core-Periphery Organization of Networks
Jaewon Yang et al.
PROCEEDINGS OF THE IEEE (2014)
Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs
C. Seshadhri et al.
STATISTICAL ANALYSIS AND DATA MINING (2014)
Clustering and community detection in directed networks: A survey
Fragkiskos D. Malliaros et al.
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS (2013)
The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees
Sofie Demeyer et al.
PLOS ONE (2013)
Spectral redemption in clustering sparse networks
Florent Krzakala et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2013)
Nictation, a dispersal behavior of the nematode Caenorhabditis elegans, is regulated by IL2 neurons
Harksun Lee et al.
NATURE NEUROSCIENCE (2012)
Enrichment and aggregation of topological motifs are independent organizational principles of integrated interaction networks
Tom Michoel et al.
MOLECULAR BIOSYSTEMS (2011)
Commute times for a directed graph using an asymmetric Laplacian
Daniel Boley et al.
LINEAR ALGEBRA AND ITS APPLICATIONS (2011)
Graph Twiddling in a MapReduce World
Jonathan Cohen
COMPUTING IN SCIENCE & ENGINEERING (2009)
Disentangling the Web of Life
Jordi Bascompte
SCIENCE (2009)
Fast unfolding of communities in large networks
Vincent D. Blondel et al.
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT (2008)
Maps of random walks on complex networks reveal community structure
Martin Rosvall et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2008)
Main-memory triangle computations for very large (sparse (power-law)) graphs
Matthieu Latapy
THEORETICAL COMPUTER SCIENCE (2008)
Evidence for the existence of a robust pattern of prey selection in food webs
Daniel B. Stouffer et al.
PROCEEDINGS OF THE ROYAL SOCIETY B-BIOLOGICAL SCIENCES (2007)
Graph clustering
Satu Elisa Schaeffer
COMPUTER SCIENCE REVIEW (2007)
Network structure of cerebral cortex shapes functional connectivity on multiple time scales
Christopher J. Honey et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2007)
Network motifs: theory and experimental approaches
Uri Alon
NATURE REVIEWS GENETICS (2007)
Clustering by passing messages between data points
Brendan J. Frey et al.
SCIENCE (2007)
Nonoptimal component placement, but short processing paths, due to long-distance projections in neural systems
Marcus Kaiser et al.
PLOS COMPUTATIONAL BIOLOGY (2006)
FANMOD: a tool for fast network motif detection
S Wernicke et al.
BIOINFORMATICS (2006)
Interaction strength combinations and the overfishing of a marine food web
J Bascompte et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2005)
Laplacians and the Cheeger inequality for directed graphs
Fan Chung
ANNALS OF COMBINATORICS (2005)
Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network -: art. no. 10
R Dobrin et al.
BMC BIOINFORMATICS (2004)
Modeling interactome: scale-free or geometric?
N Przulj et al.
BIOINFORMATICS (2004)
UbiCrawler: a scalable fully distributed Web crawler
P Boldi et al.
SOFTWARE-PRACTICE & EXPERIENCE (2004)
Motifs in brain networks
O Sporns et al.
PLOS BIOLOGY (2004)
The coherent feedforward loop serves as a sign-sensitive delay element in transcription networks
S Mangan et al.
JOURNAL OF MOLECULAR BIOLOGY (2003)
Structure and function of the feed-forward loop network motif
S Mangan et al.
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA (2003)
Network motifs: Simple building blocks of complex networks
R Milo et al.
SCIENCE (2002)