7 search results - page 1 / 2 » The Readability of Path-Preserving Clusterings of Graphs |
CGF
2010
13 years 4 months ago
2010
Graph visualization systems often exploit opaque metanodes to reduce visual clutter and improve the readability of large graphs. This filtering can be done in a path-preserving wa...
HCI
2009
13 years 2 months ago
2009
Circular anchored maps have been proposed as a drawing technique to acquire knowledge from bipartite graphs, where nodes in one set are arranged on a circumference. However, the re...
IJON
2010
13 years 3 months ago
2010
This paper proposes an organized generalization of Newman and Girvan’s modularity measure for graph clustering. Optimized via a deterministic annealing scheme, this measure prod...
TVCG
2008
13 years 4 months ago
2008
Exploring communities is an important task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads...
KES
2008
Springer
13 years 4 months ago
2008
Springer
Bipartite graphs appear in various scenes in the real world, and visualizing these graphs helps improve our understanding of network structures. The amount of information that is a...