-
2
-
-
0002825389
-
Bounds for Orthogonal 3-D Graph Drawing
-
T. Biedl, T. Shermer, S. Whitesides, S. Wismath, Bounds for Orthogonal 3-D Graph Drawing, J. Graph Algorithms and Applications, Vol. 3, No. 4, pp. 63-79, 1999.
-
(1999)
J. Graph Algorithms and Applications
, vol.3
, Issue.4
, pp. 63-79
-
-
Biedl, T.1
Shermer, T.2
Whitesides, S.3
Wismath, S.4
-
3
-
-
0004061989
-
-
Prentice-Hall Inc.
-
G. Di Battista, P. Eades, T. Tamassia, I. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall Inc., 1999.
-
(1999)
Graph Drawing: Algorithms for the Visualization of Graphs
-
-
Di Battista, G.1
Eades, P.2
Tamassia, T.3
Tollis, I.4
-
4
-
-
84957890673
-
A Split & Push Approach to 3D Orthogonal Drawing
-
Lecture Notes in Computer Science 1547, Springer Verlag
-
G. Di Battista, M. Patrignani, F. Vargiu, A Split & Push Approach to 3D Orthogonal Drawing, Symposium on Graph Drawing 98, Lecture Notes in Computer Science 1547, Springer Verlag, 1998. pp.87-101.
-
(1998)
Symposium on Graph Drawing 98
, pp. 87-101
-
-
Di Battista, G.1
Patrignani, M.2
Vargiu, F.3
-
5
-
-
0030260127
-
The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawing
-
P. Eades, C. Stirk, S. Whitesides, The Techniques of Komolgorov and Bardzin for Three Dimensional Orthogonal Graph Drawing, Information Processing Letters, Vol. 60, No 2, pp. 9-103, 1996.
-
(1996)
Information Processing Letters
, vol.60
, Issue.2
, pp. 9-103
-
-
Eades, P.1
Stirk, C.2
Whitesides, S.3
-
6
-
-
0002574617
-
Three-Dimensional Orthogonal Graph Drawing Algorithms
-
P. Eades, A. Symvonis, S. Whitesides, Three-Dimensional Orthogonal Graph Drawing Algorithms, Discrete Applied Math., Vol. 103, pp. 55-87, 2000.
-
(2000)
Discrete Applied Math.
, vol.103
, pp. 55-87
-
-
Eades, P.1
Symvonis, A.2
Whitesides, S.3
-
7
-
-
0012782376
-
About Realisation of Sets in 3-Dimensional Space
-
March
-
A. Kolmogorov, Y. Barzdin, About Realisation of Sets in 3-Dimensional Space, Problems in Cybernetics, Vol 8, pp. 261-268, March 1967.
-
(1967)
Problems in Cybernetics
, vol.8
, pp. 261-268
-
-
Kolmogorov, A.1
Barzdin, Y.2
-
8
-
-
0002830707
-
Incremental Orthogonal Graph Drawing in Three Dimensions
-
A. Papakostas, I. Tollis, Incremental Orthogonal Graph Drawing in Three Dimensions, J. of Graph Algorithms and Applications, Vol. 3, No. 4, pp. 81-115, 1999.
-
(1999)
J. of Graph Algorithms and Applications
, vol.3
, Issue.4
, pp. 81-115
-
-
Papakostas, A.1
Tollis, I.2
-
9
-
-
84957922647
-
An Algorithm for Three-Dimensional Orthogonal Graph Drawing
-
Lecture Notes in Computer Science 1547, Springer Verlag
-
D. Wood, An Algorithm for Three-Dimensional Orthogonal Graph Drawing, Symposium on Graph Drawing 98, Lecture Notes in Computer Science 1547, Springer Verlag, 1998. pp. 332-346.
-
(1998)
Symposium on Graph Drawing 98
, pp. 332-346
-
-
Wood, D.1
-
10
-
-
84958981448
-
Multi-Dimensional Orthogonal Graph Drawing with Small Boxes
-
Lecture Notes in Computer Science 1731, Springer Verlag
-
D. Wood, Multi-Dimensional Orthogonal Graph Drawing with Small Boxes, Symposium on Graph Drawing 99, Lecture Notes in Computer Science 1731, Springer Verlag, 1999, pp. 311-322.
-
(1999)
Symposium on Graph Drawing 99
, pp. 311-322
-
-
Wood, D.1
-
11
-
-
23044527401
-
Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
-
Lecture Notes in Computer Science 1984, Springer Verlag, Virginia, Sept.
-
D. Wood, Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings, Symposium on Graph Drawing 2000, Lecture Notes in Computer Science 1984, Springer Verlag, Virginia, Sept. 2000, pp. 259-271.
-
(2000)
Symposium on Graph Drawing 2000
, pp. 259-271
-
-
Wood, D.1
|