Generic model to unravel the deeper insights of viral infections: an empirical application of evolutionary graph coloring in computational network biology

Table 1 Results obtained by DEGCP Algorithm with time and success rate

DIMACS graph instances	Edges	Vertex	Known optimal \(\chi (G)\)	Best known result for \(\chi (G)\) = ?	Results obtained by DEGCP	DEGCP time (S)	DEGCP success rate
homer	1629	561	13	13	13	0.12	50/50
fpsol2.i.1	11,654	496	65	65	65	0.59	50/50
inithx.i.1	18,707	864	54	54	54	1.64	50/50
zeroin.i.1	4100	211	49	49	49	0.11	50/50
le450_25a	8260	450	25	25	25	24.81	50/50
le450_25b	8263	450	25	25	25	8.28	50/50
myciel7	2360	191	8	8	8	0.02	50/50
1-Insertions_6	6337	607	?	7	7	0.16	50/50
2-Insertions_5	3936	597	?	6	6	0.12	50/50
3-Insertions_5	9695	1406	?	6	6	0.66	50/50
4-Insertions_4	1795	475	?	5	5	0.71	50/50
1-FullIns_5	3247	282	?	6	6	0.03	50/50
2-FullIns_5	12201	852	?	7	7	0.27	50/50
3-FullIns_5	33,751	2030	?	8	8	1.20	50/50
4-FullIns_5	77,305	4146	?	9	9	5.44	50/50
5-FullIns_4	11,395	1085	?	9	9	0.35	50/50
wap05a	43,081	905	?	50	50	118.31	50/50
school1	19,095	385	?	14	14	3145.21	30/50
school1_nsh	14,612	352	?	14	14	2459.35	35/50
will199GPIA	7065	701	?	7	7	924.26	40/50

ISSN: 1471-2105