• DocumentCode
    931493
  • Title

    Hierarchies and planarity theory

  • Author

    Di Battista, Giuseppe ; Nardelli, Enrico

  • Author_Institution
    Dept. of Inf. & Syst., Roma Univ., Italy
  • Volume
    18
  • Issue
    6
  • fYear
    1988
  • Firstpage
    1035
  • Lastpage
    1046
  • 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;
  • fLanguage
    English
  • Journal_Title
    Systems, Man and Cybernetics, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9472
  • Type

    jour

  • DOI
    10.1109/21.23105
  • Filename
    23105
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=931493