• DocumentCode
    479880
  • Title

    Research on Layering Algorithm of DAG

  • Author

    Tang, Hai ; Chen, Shihong

  • Author_Institution
    Nat. Eng. Res. Center for Multimedia Software, Wuhan Univ., Wuhan
  • Volume
    2
  • fYear
    2008
  • fDate
    12-14 Dec. 2008
  • Firstpage
    271
  • Lastpage
    274
  • Abstract
    We consider the problem of partitioning a directed acyclic graph into layers such that all edges point the same directionally. We perform an experimental analysis of some of the existing layering algorithm. Then we propose simplex algorithm based on linear programming to layering a graph. The goal is to minimize the total sum of edge span so that the layered graph has a smaller area than other algorithms.
  • Keywords
    directed graphs; linear programming; directed acyclic graph partitioning; edge span sum minimization; graph layering algorithm; linear programming; simplex algorithm; Algorithm design and analysis; Computer science; Electronic mail; Engineering drawings; Linear programming; Partitioning algorithms; Performance analysis; Research and development; Software algorithms; Software engineering; graph drawing; layering algorithm; simplex algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Software Engineering, 2008 International Conference on
  • Conference_Location
    Wuhan, Hubei
  • Print_ISBN
    978-0-7695-3336-0
  • Type

    conf

  • DOI
    10.1109/CSSE.2008.803
  • Filename
    4722051
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=479880