Sciweavers

852 search results - page 2 / 171
» Using graph parsing for automatic graph drawing
Sort
View
ISAAC
1998
Springer
94views Algorithms» more  ISAAC 1998»
13 years 9 months ago
Two-Layer Planarization in Graph Drawing
Abstract. We study the two-layer planarization problems that have applications in Automatic Graph Drawing. We are searching for a two-layer planar subgraph of maximumweight in a gi...
Petra Mutzel, René Weiskircher
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
ICPR
2006
IEEE
14 years 6 months ago
Face Recognition by Expression-Driven Sketch Graph Matching
We present a novel face recognition method using automatically extracted sketch by a multi-layer grammatical face model. First, the observed face is parsed into a 3layer (face, pa...
Jiebo Luo, Zijian Xu
GD
2004
Springer
13 years 10 months ago
Drawing the AS Graph in 2.5 Dimensions
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
Michael Baur, Ulrik Brandes, Marco Gaertler, Dorot...
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...