Figure 1From: BFL: a node and edge betweenness based fast layout algorithm for large scale networksRuntime changes from graph size. Result of running the BFL algorithm on graphs of degree 3 ranging from 400 to 3000 nodes and measuring runtime.Back to article page