Figure 3From: Fast calculation of the quartet distance between trees of arbitrary degreesExperimental running times. The running time of the algorithm for worst case trees, d-ary trees and random trees. The lines plots the polynomials c. n^{i}, where c is a fitted constant and i ∈ [1, 4]. The two bottommost plots are in log-scale on both the x- and y-axis.Back to article page