2455 search results - page 58 / 491 » Graphical abstract help |
DCC
2006
IEEE
14 years 16 days ago
2006
IEEE
Abstract. We address the problem of designing optimal prefix-free codes over an encoding alphabet with unequal integer letter costs. The most efficient algorithm proposed so far ha...
GD
2000
Springer
14 years 14 days ago
2000
Springer
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 ...
GD
2000
Springer
14 years 14 days ago
2000
Springer
Abstract. The need for a similarity measure for comparing two drawings of graphs arises in problems such as interactive graph drawing and the indexing or browsing of large sets of ...
RT
2000
Springer
14 years 13 days ago
2000
Springer
Abstract. Different methods for prefiltered environment maps have been proposed, each of which has different advantages and disadvantages. We present a general notation for prefilt...
GD
1995
Springer
14 years 13 days ago
1995
Springer
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...