30 search results - page 1 / 6 » Algorithms for Cluster Busting in Anchored Graph Drawing |
CASCON
1992
13 years 5 months ago
1992
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...
JGAA
1998
13 years 4 months ago
1998
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...
IV
2010
IEEE
13 years 3 months ago
2010
IEEE
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...
ALGORITHMICA
2006
13 years 4 months ago
2006
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...