Visualization of quasi-median networks

An algorithm for automatic drawing of quasi-median networks is proposed that uses Eulerian cycles in the non-strong-compatibility graph to lay out the network in the plane.