タグ

Mavisto

1 件の記事

Different occurrences of a sub-graph in a graph. (M1 – M4) are different occurrences of sub-graph (b) in graph (a). For frequency concept F1, the set M1, M2, M3, M4 represent all matches, so F1 = 4. For F2, one of the two set M1, M4 or M2, M3 are possible matches, F2 = 2. Finally, for frequency concept F3, merely one of the matches (M1 to M4) is allowed, therefore F3 = 1. The frequency of these three frequency concepts decrease as the usage of network elements are restricted.

ネットワークモチーフ複雑なネットワークを構成する基本構造と検出アルゴリズム

ネットワークモチーフグラフ理論サブグラフFANMOD
2026年8月11日続きを読む →