Sciweavers

326 search results - page 2 / 66
» A Library of Algorithms for Graph Drawing
Sort
View
GD
2009
Springer
13 years 3 months ago
On Open Problems in Biological Network Visualization
Much of the data generated and analyzed in the life sciences can be interpreted and represented by networks or graphs. Network analysis and visualization methods help in investigat...
Mario Albrecht, Andreas Kerren, Karsten Klein, Oli...
GD
2003
Springer
13 years 10 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
DAM
2000
84views more  DAM 2000»
13 years 5 months ago
Three-dimensional orthogonal graph drawing algorithms
We use basic results from graph theory to design algorithms for constructing three-dimensional, intersection-free orthogonal grid drawings of n vertex graphs of maximum degree 6. ...
Peter Eades, Antonios Symvonis, Sue Whitesides
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
13 years 5 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
GD
2005
Springer
13 years 10 months ago
Applications of Parameterized st-Orientations in Graph Drawing Algorithms
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
Charalampos Papamanthou, Ioannis G. Tollis