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
Parents
18
Dynamic Drawing of Clustered Graphs
Y. Frishman, Ayellet Tal · IEEE Symposium on Information Visualization · 2004 · 87 citations
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Peter Eades, Qing-Wen Feng, Xuemin Lin et al. · Algorithmica · 2005 · 74 citations
Dynamic Drawing of Clustered Graphs
Y. Frishman, Ayellet Tal · IEEE Symposium on Information Visualization · 2005 · 68 citations
1–5 of 18
38
4
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 38
24

The University of Sydney
Sydney, Australia
3 h-index
7 publications
295 citations
Japan Advanced Institute of Science and Technology
Nomi Shi, Japan
2 h-index
4 publications
54 citations
Technion – Israel Institute of Technology
Haifa, Israel
2 h-index
4 publications
310 citations

Kyoto University
Kyoto, Japan
2 h-index
2 publications
99 citations
University of Perugia
Perugia, Italy
2 h-index
4 publications
56 citations
University of Arizona
Tucson, United States
1 h-index
3 publications
45 citations
FORTH Institute of Computer Science
Heraklion, Greece
1 h-index
1 publications
12 citations

Data61
Sydney, Australia
1 h-index
2 publications
148 citations
1–8 of 24
JGAA · 4 publications · 234 citations
4
h-index
Conference · 2 publications · 155 citations
2
h-index
Conference · 1 publications · 16 citations
1
h-index
TVCG · 1 publications · 21 citations
1
h-index
1 publications · 12 citations
1
h-index
1–5