20 search results - page 3 / 4 » Drawing the AS Graph in 2.5 Dimensions |
GD
2006
Springer
13 years 9 months ago
2006
Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
GD
2001
Springer
13 years 10 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
GD
2006
Springer
13 years 9 months ago
2006
Springer
The crossing number cr(G) of a graph G is the minimum number of crossings over all drawings of G in the plane. In 1993, Richter and Thomassen [RT93] conjectured that there is a co...
COMGEO
2004
ACM
13 years 5 months ago
2004
ACM
We present a novel hierarchical force-directed method for drawing large graphs. Given a graph G = (V,E), the algorithm produces an embedding for G in an Euclidean space E of any d...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner ...