30 search results - page 2 / 6 » Algorithms for Cluster Busting in Anchored Graph Drawing |
136
click to vote
JDA
2010
15 years 1 months ago
2010
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
113
Voted
GD
2005
Springer
15 years 8 months ago
2005
Springer
Clustered graph is a very useful model for drawing large and complex networks. This paper presents a new method for drawing clustered graphs in three dimensions. The method uses a ...
130
Voted
SIAMSC
2008
15 years 2 months ago
2008
We propose a distributed algorithm for solving Euclidean metric realization problems arising from large 3D graphs, using only noisy distance information, and without any prior kno...
157
Voted
WAW
2010
Springer
15 years 18 days ago
2010
Springer
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...
143
Voted
IV
2009
IEEE
15 years 9 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...