Skip to main content

Table 6 Performance of IWDS on real-world network for \(k=20\), varying \(\alpha\) from 0.05 to 0.9. For each network, we report the running time in minutes, the density and the distance

From: A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks

Set

\(\alpha =0.05\)

\(\alpha =0.1\)

\(\alpha =0.25\)

\(\alpha =0.5\)

\(\alpha =0.75\)

\(\alpha =0.9\)

Alignment-graph

Time

0.055

0.058

0.062

0.065

0.068

0.068

Density

28.14

30.45

37.14

46.44

47.73

52.94

Distance

378.76

373.61

359.94

351.50

347.81

339.17

G-graphA

Time

89.84

98.72

184.87

336.72

426.56

486.68

Density

2863.99

4000.73

6345.67

10989.07

9297.13

10737.01

Distance

275.82

257.84

220.16

210.79

196.06

193.02

DBLP-graphA

Time

105.69

125.71

165.25

212.07

251.08

277.39

Density

39.61

52.39

74.12

91.13

97.25

98.78

Distance

307.72

231.25

213.04

204.37

198.54

196.96

HS-graphA

Time

209.88

749.06

1027.58

–

–

–

Density

1326.07

1153.68

1799.22

Distance

226.40

212.34

205.55