Currently, the time limit is only used to terminate the two, three and annealing exchange algorithms if they have exceeded the time limit after one complete iteration, i.e. after all possible two or three exchanges have been tested or when the annealing temperature is decreased. So it is possible that the execution time of the improvement algorithm is actually larger than the time limit specified. The time limit is also used to terminate combination algorithms such as All Graph, All Layout, and All Graph and Layout Algorithms if the combination algorithm has exceeded the time limit after a component algorithm. Finally, the time limit is also used to terminate the Graph Upper Bound algorithm, which checks periodically if the time limit has been exceeded.