Sciweavers

59 search results - page 3 / 12
» FADE: Graph Drawing, Clustering, and Visual Abstraction
Sort
View
KES
2008
Springer
13 years 7 months ago
Readable Representations for Large-Scale Bipartite Graphs
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...
Shuji Sato, Kazuo Misue, Jiro Tanaka
WAW
2010
Springer
306views Algorithms» more  WAW 2010»
13 years 5 months ago
Finding and Visualizing Graph Clusters Using PageRank Optimization
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
Fan Chung Graham, Alexander Tsiatas
CONSTRAINTS
1998
108views more  CONSTRAINTS 1998»
13 years 7 months ago
Constraints in Graph Drawing Algorithms
Graphs are widely used for information visualization purposes, since they provide a natural and intuitive tation of complex abstract structures. The automatic generation of drawing...
Roberto Tamassia
SDM
2010
SIAM
213views Data Mining» more  SDM 2010»
13 years 8 months ago
Spectral Analysis of Signed Graphs for Clustering, Prediction and Visualization
We study the application of spectral clustering, prediction and visualization methods to graphs with negatively weighted edges. We show that several characteristic matrices of gra...
Jérôme Kunegis, Stephan Schmidt, Andr...
GD
2003
Springer
14 years 18 days ago
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Na...