Two trees which are self-intersecting when drawn simultaneously

Kaufmann, Michael and Vrt'o, Imrich and Geyer, Markus (2006) Two trees which are self-intersecting when drawn simultaneously. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 201-210(Official URL: http://dx.doi.org/10.1007/11618058_19).

Full text not available from this repository.

Abstract

An actual topic in the graph drawing is the question how to draw two edge sets on the same vertex set, the so-called simultaneous drawing of graphs. The goal is to simultaneously find a nice drawing for both of the sets. It has been found out that only restricted classes of planar graphs can be drawn simultaneously using straight lines and without crossings within the same edge set. In this paper, we negatively answer one of the most often posted open questions namely whether any two trees with the same vertex set can be drawn simultaneously crossing-free in a straight line way.

Item Type: Conference Paper
Additional Information: 10.1007/11618058_19
Classifications: Z Theory > Z.500 Representations
M Methods > M.900 Tree
P Styles > P.720 Straight-line
G Algorithms and Complexity > G.490 Embeddings
G Algorithms and Complexity > G.560 Geometry
URI: http://gdea.informatik.uni-koeln.de/id/eprint/692

Actions (login required)

View Item View Item