<--- Back to Details
First PageDocument Content
Theoretical computer science / Graphlets / Community structure / GRAph ALigner / Clique / Neighbourhood / Graph / Subgraph isomorphism problem / Topology / Graph theory / Mathematics / Networks
Theoretical computer science
Graphlets
Community structure
GRAph ALigner
Clique
Neighbourhood
Graph
Subgraph isomorphism problem
Topology
Graph theory
Mathematics
Networks

Applied Graph-Mining Algorithms to Study Biomolecular Interaction Networks

Add to Reading List

Source URL: www.ncbi.nlm.nih.gov

Download Document from Source Website

File Size: 601,38 KB

Share Document on Facebook

Similar Documents

Geometry & Topology–Topological properties of Hilbert schemes of almost-complex four-manifolds II

Geometry & Topology–Topological properties of Hilbert schemes of almost-complex four-manifolds II

DocID: 1xVL5 - View Document

Algebraic & Geometric Topology–Generic representations of orthogonal groups: the mixed functors

Algebraic & Geometric Topology–Generic representations of orthogonal groups: the mixed functors

DocID: 1xVsM - View Document

Geometry & Topology–K –duality for stratified pseudomanifolds C LAIRE D EBORD

Geometry & Topology–K –duality for stratified pseudomanifolds C LAIRE D EBORD

DocID: 1xVky - View Document

NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich

NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich

DocID: 1xVcN - View Document

NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich

NetHide: Secure and Practical Network Topology Obfuscation Roland Meier∗ , Petar Tsankov∗ , Vincent Lenders , Laurent Vanbever∗ , Martin Vechev∗ ∗ ETH Zürich

DocID: 1xV3c - View Document