Graph Compaction

Graph Compaction is a graph drawing technique that belongs to the class of layout optimization methods, specifically distinguished by its focus on minimizing the spatial area or geometric footprint of a graph layout while preserving its structural topology and readability constraints.

31

Publications

1.4K

Citations

57

Authors

39

Institutions

Publications per year

2017–2026

4

Authors

57

  1. NV
    Narayan Vikas

    Simon Fraser University, Canada

    3 publications · 94 citations

    3

    h-index

  2. PH
    Pei‐Yung Hsiao

    National Taiwan University, Taiwan

    2 publications · 26 citations

    2

    h-index

  3. SA
    Srinivas Aluru

    Iowa State University, United States

    2 publications · 57 citations

    2

    h-index

  4. YL
    Yihan Liao

    IBM Research - Thomas J. Watson Research Center, United States

    2 publications · 93 citations

    2

    h-index

  5. TD
    Tim Dwyer

    Monash University, Australia

    1 publications · 43 citations

    1

    h-index

1–5 of 57

Venues

  1. 5

    h-index

  2. SIAM Journal on Computing

    2 publications · 64 citations

    2

    h-index

  3. Linear Algebra and its Applications

    2 publications · 78 citations

    2

    h-index

  4. Design Automation Conference

    Conference · 2 publications · 68 citations

    2

    h-index

  5. Algorithmica

    2 publications · 87 citations

    2

    h-index

1–5