Tree layout has received considerable attention because of its practical importance. Arguably the most common drawing convention is the (ordered) layered tree convention for rooted trees in which the layout is required to preserve the relative order of a node’s children. However, in some applications preserving the ordering of children is not important, and considerably more compact layout can be achieved if this requirement is dropped. Here we introduce the unordered layered tree drawing convention for binary rooted trees and show that determining a minimal width drawing for this convention is NP-complete.
|Title of host publication||Graph Algorithms and Applications 5|
|Publisher||World Scientific Publishing|
|Number of pages||18|
|ISBN (Print)||981256845X, 9789812568458|
|Publication status||Published - 1 Jan 2006|