Solving the k-dominating set problem on very large-scale networks

Computational Social Networks

Table 4 Result of algorithms on large graphs

Data	\(\text{HEU}_1\)		\(\text{HEU}_3\)		\(\text{HEU}_4\)
Data	Sol	T (s)	Sol	T (s)	Sol	T (s)
\(k = 1\)
soc-delicious	215261	19.07	56066	1464.84	56600	5679.63
soc-flixster	1452450	999	_	_	91543	27374.44
hugebubbles	1213638	2087.83	_	_	1169394	7498.20
soc-livejournal	1538044	2689.72	_	_	930632	75185.96
soc-partner-1	6263241	64228.04	_	_	29278	26740.42
soc-partner-2	4129393	19109	_	_	38303	38644.65
\(k = 2\)
soc-delicious	34516	3.57	_	_	8155	2064.00
soc-flixster	48789	85.93	_	_	9860	23694.58
hugebubbles	943233	792.96	_	_	777960	41874.54
soc-livejournal	447552	1582.87	_	_	189121	16728.22
soc-partner-1	11102	59.78	_	_	12200	31962.21
soc-partner-2	20343	84.15	_	_	19896	27159.79
\(k = 3\)
soc-delicious	14806	2.44	_	_	1505	1695.77
soc-flixster	20996	29.71	_	_	313	3333.45
hugebubbles	843077	649.47	_	_	688817	17221.76
soc-livejournal	211894	394.98	_	_	83710	42600.51
soc-partner-1	6337	55.57	_	_	5158	5200.14
soc-partner-2	12807	78.3	_	_	10905	5481.59