An Application of Well-Orderly Trees in Graph Drawing

Zhang, Huaming and He, Xin (2006) An Application of Well-Orderly Trees in Graph Drawing. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005 , pp. 458-467(Official URL: http://dx.doi.org/10.1007/11618058_41).

Full text not available from this repository.

Abstract

Well-orderly trees seems to have the potential of becoming a powerful technique capable of deriving new results in graph encoding, graph enumeration and graph generation [3, 4]. In this paper, we reduce the height of the visibility representation of plane graphs from 5n/6 to (4n-1)/5, by using well-orderly trees.

Item Type:	Conference Paper
Additional Information:	10.1007/11618058_41
Classifications:	P Styles > P.900 Visibility M Methods > M.999 Others
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/710

Actions (login required)

View Item