Sciweavers

4 search results - page 1 / 1
» Cluster busting in anchored graph drawing
Sort
View
CASCON
1992
134views Education» more  CASCON 1992»
13 years 5 months ago
Cluster busting in anchored graph drawing
Given a graph G and a drawing or layout of G, it is sometimes desirable to alter or adjust the layout. The challenging aspect of designing layout adjustment algorithms is to maint...
Kelly A. Lyons
JGAA
1998
70views more  JGAA 1998»
13 years 4 months ago
Algorithms for Cluster Busting in Anchored Graph Drawing
Kelly A. Lyons, Henk Meijer, David Rappaport
HCI
2009
13 years 2 months ago
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D
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...
Takao Ito, Kazuo Misue, Jiro Tanaka
IV
2010
IEEE
193views Visualization» more  IV 2010»
13 years 3 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka