On embedding a graph in the grid with the minimum number of bends
SIAM Journal on Computing
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Graph Visualization Techniques for Web Clustering Engines
IEEE Transactions on Visualization and Computer Graphics
Overlapping Clustered Graphs: Co-authorship Networks Visualization
SG '08 Proceedings of the 9th international symposium on Smart Graphics
| Hi-index | 0.00 |
Most of the layout algorithms for clustered graphs have been designed to differentiate the groups within the graph, however they do not take into account the interactions between such groups. Identifying these interactions allows to understand how the different communities exchange messages or information, and allows the social network researcher to identify key actors, social roles and paths from one community to another. These interactions are performed by actors who actually share links with different communities. Thus, dividing the set of nodes into those who interact with several communities and those who only interact with their own communities, will give some insight about how the communities interact.