Before revision: Special classes of graphs Trees The class of trees that admit greedy drawings has been completely characterized, and a greedy drawing of a tree can be found in linear time when it exists.
After revision: Special classes of graphs Trees The class of trees that admit greedy embeddings has been completely characterized, and a greedy embedding of a tree can be found in linear time when it exists.