Figure 3From: BiCluE - Exact and heuristic algorithms for weighted bi-cluster editing of biomedical dataRunning times of fixed-parameter algorithm and edge deletion heuristics against graph complexities. The figure shows the running times against graph complexities, i.e. |V|·|E| for artificial graphs. Note the log-scaling of the axes. Colors: blue - edge deletion heuristics, red - fixed-parameter algorithm.Back to article page