34 search results - page 5 / 7 » Graph Layout Adjustment Strategies |
BXML
2004
13 years 8 months ago
2004
Abstract: Engineering personalized ubiquitous Web applications requires to develop adaptable Web content as well as to automatically adjust it to varying client devices and dynamic...
GD
2005
Springer
14 years 29 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
GBRPR
2007
Springer
14 years 1 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
IV
2005
IEEE
14 years 1 months ago
2005
IEEE
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
DAC
2011
ACM
12 years 7 months ago
2011
ACM
Today’s multiprocessor system-on-a-chip (MPSoC) products typically have multiple execution modes, and for each mode, all the products utilize the same task allocation and schedu...