Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Sevim, Taha"'
A $k$-motif (or graphlet) is a subgraph on $k$ nodes in a graph or network. Counting of motifs in complex networks has been a well-studied problem in network analysis of various real-word graphs arising from the study of social networks and bioinform
Externí odkaz:
http://arxiv.org/abs/2002.06957
