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

Computational Social Networks

Table 3 Result of algorithms on medium graphs

Data	\(\text{HEU}_1\)		\(\text{HEU}_3\)		\(\text{HEU}_4\)
Data	Sol	T (s)	Sol	T (s)	Sol	T (s)
\(k = 1\)
ca-GrQc	1210	0.00	803	0.15	776	1.38
ca-HepPh	2961	0.01	1730	1.54	1662	6.49
ca-AstroPh	3911	0.02	2175	1.79	2055	15.22
ca-CondMat	5053	0.04	3104	4.20	2990	21.35
email-enron-large	12283	0.10	2005	4.48	1972	37.71
soc-BlogCatalog	49433	0.72	4896	26.89	4915	1839.26
\(k = 2\)
ca-GrQc	415	0.00	285	0.10	260	1.77
ca-HepPh	879	0.00	473	0.99	410	13.76
ca-AstroPh	1073	0.02	457	2.93	381	47.02
ca-CondMat	1617	0.02	922	1.65	806	17.32
email-enron-large	1256	0.03	360	7.91	346	31.45
soc-BlogCatalog	2870	0.18	_	_	229	883.09
\(k = 3\)
ca-GrQc	251	0.01	120	0.35	102	2.71
ca-HepPh	430	0.02	138	14.63	117	53.76
ca-AstroPh	438	0.06	122	75.60	106	203.18
ca-CondMat	898	0.02	302	5.82	266	63.16
email-enron-large	724	0.14	_	_	92	203.72
soc-BlogCatalog	87	0.06	_	_	15	1616.70