2635 search results - page 32 / 527 » Algorithms for the Database Layout Problem |
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
111
click to vote
INFOVIS
2005
IEEE
15 years 8 months ago
2005
IEEE
Treemaps are a well-known method for the visualization of attributed hierarchical data. Previously proposed Treemap layout algorithms are limited to rectangular shapes, which caus...
119
click to vote
IPL
2002
15 years 2 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
FPL
2003
Springer
15 years 7 months ago
2003
Springer
With inherent problem complexity, ever increasing instance size and ever decreasing layout area, there is need in physical design for improved heuristics and algorithms. In this in...
107
click to vote
IADIS
2008
15 years 3 months ago
2008
Marketing databases are currently one of the most important resources in any marketing departments. Regarding their customer knowledge needs many of them had develop their own dat...