Clustered Graph Drawing

Clustered Graph Drawing is a graph drawing method that extends conventional graph layout techniques by incorporating hierarchical clustering information, where nodes are recursively grouped into clusters and visualized as nested regions to reveal both the topological structure and the hierarchical organization of the graph.

18

Publications

816

Citations

38

Authors

24

Institutions

Publications per year

2017–2026

1

Authors

38

  1. PE
    Peter Eades

    The University of Sydney, Australia

    4 publications · 267 citations

    4

    h-index

  2. HN
    Hiroshi Nagamochi

    Kyoto University, Japan

    3 publications · 143 citations

    3

    h-index

  3. WD
    Walter Didimo

    University of Perugia, Italy

    2 publications · 28 citations

    2

    h-index

  4. HO
    Hiroki Omote

    Japan Advanced Institute of Science and Technology, Japan

    2 publications · 27 citations

    2

    h-index

  5. QF
    Qing-Wen Feng

    Kyoto University, Japan

    2 publications · 118 citations

    2

    h-index

1–5 of 38

Venues

  1. Journal of Graph Algorithms and Applications

    JGAA · 4 publications · 234 citations

    4

    h-index

  2. IEEE Symposium on Information Visualization

    Conference · 2 publications · 155 citations

    2

    h-index

  3. 2012 16th International Conference on Information Visualisation

    Conference · 1 publications · 16 citations

    1

    h-index

  4. IEEE Transactions on Visualization and Computer Graphics

    TVCG · 1 publications · 21 citations

    1

    h-index

  5. Computer Graphics Forum

    1 publications · 12 citations

    1

    h-index

1–5