Computation times of the layout algorithms. The running times (in seconds) are plotted as a function of the network size (number of nodes). The number of the nodes correlated significantly with the running times of the MLL, MLL-C (with or without the M-tree option) and FDL algorithms (p < 10-5). The running time of the proprietary ORL implementation converged after 1000 nodes. The systematically slowest SEL algorithm was omitted from the illustration, since it could draw only 7 out of the 11 test networks in less than one hour. The arrows point the two largest SGA genetic interaction networks (Costanzo and Costanzo-Stringent).