Title :
Hierarchies and planarity theory
Author :
Di Battista, Giuseppe ; Nardelli, Enrico
Author_Institution :
Dept. of Inf. & Syst., Roma Univ., Italy
Abstract :
In diagrammatic representations of hierarchies the minimization of the number of crossings between edges is a well-known criterion for improving readability. An efficient algorithm for testing if a hierarchy is planar (i.e. if it can be drawn without edge crossings) is proposed. A complete combinatorial characterization of the class of planar hierarchies is also given
Keywords :
computational complexity; graph theory; minimisation; combinatorial characterization; crossings; diagrammatic representations; edges; hierarchy; minimization; planarity theory; readability; Algorithm design and analysis; Computer science; Councils; Data structures; Graphics; Instruments; Terrorism; Testing;
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
