Sciweavers

Share
GD
2003
Springer
10 years 3 months ago
The Puzzle Layout Problem
We address the new problem of puzzle layout as a new application of awing. We present two abstract models of puzzles, permutation puzzles and cyclic puzzles, which can be modeled a...
Kozo Sugiyama, Seok-Hee Hong, Atsuhiko Maeda
GD
2003
Springer
10 years 3 months ago
How Many Ways Can One Draw a Graph?
János Pach, Géza Tóth
GD
2003
Springer
10 years 3 months ago
An Energy Model for Visual Graph Clustering
We introduce an energy model whose minimum energy drawings reveal the clusters of the drawn graph. Here a cluster is a set of nodes with many internal edges and few edges to nodes ...
Andreas Noack
GD
2003
Springer
10 years 3 months ago
HexGraph: Applying Graph Drawing Algorithms to the Game of Hex
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...
Colin Murray, Carsten Friedrich, Peter Eades
GD
2003
Springer
10 years 3 months ago
Track Drawings of Graphs with Constant Queue Number
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
Emilio Di Giacomo, Henk Meijer
GD
2003
Springer
10 years 3 months ago
Three-Dimensional Grid Drawings with Sub-quadratic Volume
A three-dimensional grid drawing of a graph is a placement of the vertices at distinct points with integer coordinates, such that the straight line-segments representing the edges ...
Vida Dujmovic, David R. Wood
GD
2003
Springer
10 years 3 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
GD
2003
Springer
10 years 3 months ago
Intersection-Free Morphing of Planar Graphs
Given two different drawings of a planar graph we consider the problem of morphing one drawing into the other. We designed and implemented an algorithm for intersection-free morph...
Cesim Erten, Stephen G. Kobourov, Chandan Pitta
GD
2003
Springer
10 years 3 months ago
Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
In this paper we consider the problem of drawing and displaying a series of related graphs, i.e., graphs that share all, or parts of the same node set. We present three algorithms...
Cesim Erten, Stephen G. Kobourov, Vu Le, Armand Na...
books