Sciweavers

5889 search results - page 25 / 1178
» Graph Layout Problems
Sort
View
GD
2000
Springer
14 years 1 months ago
Fast Layout Methods for Timetable Graphs
Abstract. Timetable graphs are used to analyze transportation networks. In their visualization, vertex coordinates are fixed to preserve the underlying geography, but due to small ...
Ulrik Brandes, Galina Shubina, Roberto Tamassia, D...
ACSC
2003
IEEE
14 years 3 months ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
Xiaodi Huang, Wei Lai
VL
2010
IEEE
261views Visual Languages» more  VL 2010»
13 years 8 months ago
Euler Graph Transformations for Euler Diagram Layout
— Euler diagrams are frequently used for visualizing information about collections of objects and form an important component of various visual languages. Properties possessed by...
Peter Rodgers, Gem Stapleton, John Howse, Leishi Z...
ICDT
2005
ACM
131views Database» more  ICDT 2005»
14 years 3 months ago
Algorithms for the Database Layout Problem
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
Gagan Aggarwal, Tomás Feder, Rajeev Motwani...
APVIS
2007
13 years 11 months ago
Using eye tracking to investigate graph layout effects
Graphs are typically visualized as node-link diagrams. Although there is a fair amount of research focusing on crossing minimization to improve readability, little attention has b...
Weidong Huang