BFL: a node and edge betweenness based fast layout algorithm for large scale networks

BMC Bioinformatics

Table 6 Runtime Comparisons

	Runtime Comparisons Between Algorithms
Dataset Number of Node/Edge	Random Graph 2000/7000	Random Graph 4000/12000	UO Analysis 1897/2849	Dense Graph 2000/11000	Dense Graph 2000/47000
Betweenness	.4s	1.4s	.8s	.05s	3.7s
Kamada-Kawai (Pajek)	17.9s	40.3s	22.2s	14.16s	32.64s
Fruchterman Reingold (Pajek)	30s	34s	31s	33.20s	42.06s
GEM (Tulip)	485s	1800s+	665s	394.95s	475s
RSFDP (InterViewer)	1.8s	2.1s	2.1 s	31.22s	40.46s

Runtime of the proposed method is compared to those fo existing methods (Kamada-Kawai, Fruchterman Reingold, GEM, and RSDFP) for several graphs. Dense Graph 2000/11000 and Dense Graph 2000/47000 were generated by adding 4000 and 40000 edges respectively to 10% nodes in Random Graph 2000/7000.

ISSN: 1471-2105