| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419903 | Discrete Applied Mathematics | 2011 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Konrad Schwarz, Arne Dür,