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.

► We present a new algorithm for drawing quasi-median networks.
► The proposed algorithm fulfills the congruence condition for drawing product graphs.
► The quasi-median network is decomposed into blocks around a center.
► The layout uses Eulerian cycles in the non-strong-compatibility graph.