Visualization of quasi-median networks

Authors:
Konrad Schwarz;Arne Dür
Affiliations:
Breath Research Institute, Austrian Academy of Sciences, Dammstraíe 22, A-6650 Dornbirn, Austria;Department of Mathematics, University of Innsbruck, Technikerstraíe 13, A-6020 Innsbruck, Austria
Venue:
Discrete Applied Mathematics
Year:
2011

Citing 6
Cited 0

Regular Article: Trees, Taxonomy, and Strongly Compatible Multi-state Characters

Advances in Applied Mathematics
Quasi-median graphs from sets of partitions

Discrete Applied Mathematics
Quasi-median graphs, their generalizations, and tree-like equalities

European Journal of Combinatorics
Quasi-median hulls in Hamming space are Steiner hulls

Discrete Applied Mathematics
Visualization of Graph Products

IEEE Transactions on Visualization and Computer Graphics
More flexible radial layout

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.04

Visualization

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.