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

Applied Network Science

Table 4 Performance of IWDS on overlapping generated networks with added noise varying from 0.05 to 0.15 (called synthetic4) for \(k=5\), varying \(\alpha\) from 0.05 to 0.9, the running time (in minutes), the density and the distance are averaged over 90 examples

Noise	\(\alpha =0.05\)	\(\alpha =0.1\)	\(\alpha =0.25\)	\(\alpha =0.5\)	\(\alpha =0.75\)	\(\alpha =0.9\)
0.05
Time	0.0090	0.0112	0.0149	0.0180	0.0203	0.0205
Density	21.34	24.89	32.09	45.92	57.31	63.50
Distance	18.361	17.506	15.823	15.550	15.220	15.024
F1[t/d]	0.649	0.660	0.563	0.692	0.631	0.527
F1[d/t]	0.131	0.228	0.332	0.589	0.806	0.927
0.10
Time	0.0098	0.0118	0.0137	0.0178	0.0195	0.0212
Density	21.95	25.54	32.72	46.35	58.43	65.25
Distance	18.275	17.260	15.761	15.229	14.876	13.847
F1[t/d]	0.648	0.568	0.567	0.595	0.548	0.463
F1[d/t]	0.131	0.225	0.330	0.581	0.807	0.936
0.15
Time	0.0092	0.0113	0.0149	0.0178	0.02	0.0218
Density	22.40	26.06	32.98	46.68	58.91	65.75
Distance	18.213	17.189	15.332	14.932	14.263	12.717
F1[t/d]	0.624	0.555	0.501	0.539	0.419	0.303
F1[d/t]	0.134	0.223	0.336	0.586	0.811	0.938