scientific article; zbMATH DE number 812077

MaRDI QIDQ4853751zbMATH OpenFDO

Authors Peter Eades

Publication date 1 November 1995

zbMATH Keywords

free treesdrawing algorithms

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(5)

• The realization problem for Euclidean minimum spanning trees is NP-hard
• A framework and algorithms for circular drawings of graphs
• Tree Drawings on the Hexagonal Grid
• Complexity analysis of balloon drawing for rooted trees
• Drawing trees with perfect angular resolution and polynomial area

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4853751)