Multilevel Layout Algorithms

Multilevel Layout Algorithms is a class of graph layout techniques that hierarchically coarsen a graph into multiple levels of abstraction, optimize the layout on the coarsest level, and iteratively refine and uncoarsen it to produce a scalable and readable visualization.

11

Publications

650

Citations

24

Authors

14

Institutions

Publications per year

2017–2026

1

Authors

24

  1. GV
    G. V. Reklaitis

    Purdue University West Lafayette, United States

    2 publications · 98 citations

    2

    h-index

  2. SJ
    S. Jayakumar

    Guru Nanak Dev University, India

    2 publications · 98 citations

    2

    h-index

  3. FM
    Fabrizio Montecchiani

    University of Perugia, Italy

    1 publications · 33 citations

    1

    h-index

  4. CW
    Chris Walshaw

    University of Greenwich, United Kingdom

    1 publications · 156 citations

    1

    h-index

  5. NS
    Navaratnasothie Selvakkumaran

    University of Minnesota, United States

    1 publications · 19 citations

    1

    h-index

1–5 of 24

Venues

  1. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 2 publications · 257 citations

    2

    h-index

  2. Computers & Chemical Engineering

    2 publications · 98 citations

    2

    h-index

  3. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 1 publications · 33 citations

    1

    h-index

  4. Journal of Graph Algorithms and Applications

    JGAA · 1 publications · 156 citations

    1

    h-index

  5. 1

    h-index

1–5