Approximating the Number of Network Motifs
From MaRDI portal
Publication:5388291
DOI10.1080/15427951.2009.10390645zbMath1239.68056OpenAlexW3029825151MaRDI QIDQ5388291
Publication date: 18 April 2012
Published in: Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.im/1318269502
Learning and adaptive systems in artificial intelligence (68T05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Sublinear-time algorithms for counting star subgraphs via edge sampling ⋮ A Fast Counting Method for 6-Motifs with Low Connectivity
This page was built for publication: Approximating the Number of Network Motifs
