
194
Complex Networks: An Algorithmic Perspective
9.4.2.3 MODA with Sampling
The mapping module of MODA uses a lot of time although it searches a small part
of the expansion tree. A sampling method is added to this module to improve the
performance which searches only the samples based on the root vertices to reduce
time [18]. The new mapping module uses a probability distribution proportional to
the degrees of the nodes in line 5, since probability of finding a subgraph around
higher degree nodes is higher than the ones with lower degrees as shown in Alg. 9.14
[24].
Algorithm 9.14 MODA Sample
1: Input : network graph G(V,E), query graph G
′
(V
′
,E
′
)
2: