Fig. 10
From: Investigating the complexity of the double distance problems
Example of execution of Algorithm 1 in cycle-bubbles. In both cases the algorithm starts on the dark blue edge of square 1. In (i) we have a balanced cycle-bubble, for which the resulting straight disambiguation and its complementary alternative have the same score (co-optimality). In (ii) we have an unbalanced cycle-bubble, for which the resulting straight disambiguation and its complementary alternative have distinct scores