This is a searchable database. Please use the following search form:
Updated on Tue Jan 23 19:12:45 1996
- [1]
- ACM.
ACM Press, 1982.
- [2]
- ACM.
ACM Press, 1983.
- [3]
- ACM.
ACM Press, 1985.
- [4]
- ACM.
ACM Press, 1987.
- [5]
- ACM.
ACM Press, 1991.
- [6]
- ACM.
ACM Press, 1992.
- [7]
- ACM.
ACM Press, 1993.
- [8]
- ACM.
Addison Wesley, April 1993.
- [9]
- ACM.
ACM Press, November 1993.
- [10]
- M. R. Anderberg.
Cluster Analysis for applications.
Academic Press, 1973.
- [11]
- E. R. Barnes.
An algorithm for partitioning the nodes of a graph.
SIAM Journal of Algorithmic and Discrete Methods, 3(4):541-550,
1982.
- [12]
- C. Batini, E. Nardelli, and Roberto Tamassia.
A layout algorithm for data flow diagrams.
IEEE Transactions on Software Engineering, SE-12(4):538-546, April
1986.
Layout,Drawing,Diagrams,DataFlow.
- [13]
- Giuseppe Di Battista, Amedeo Giammarco, Giuseppe Santucci, and
Roberto Tamassia.
The architecture of diagram server.
In Proceedings of the 1990 IEEE Workshop on Visual Languages. IEEE
Computer Society, 1990.
Diagram Server is a support tool for
systems that manage a diagrammatic interface. It offers a tailorable
interface that is independent from the system that uses it and that can
manage objects through their diagrammatic representations. Moreover, it
supports multiplie representations of the same object and is largely
independent from the graphic environment. In this paper we describe the
architecture of Diagram Server, with emphasis on the fundamental role played
by its automatic lauyout facility.
- [14]
- Giuseppe Di Battista, Roberto Tamassia, and Ioannis G. Tollis.
Area requirement and symmetry display of planar upward drawings.
Technical Report CS-90-10, Brown University, 1990.
- [15]
- Giuseppe Di Battista, Roberto Tamassia, and Ioannis G. Tollis.
Area requirement and symmetry display of planar upward drawings.
Discrete & Computational Geometry, 7:381-401, 1992.
- [16]
- G. Di Battista, P. Eades, H. de Fraysseix, P. Rosenstiehl, and
R. Tamassia, editors.
Proceedings of the ALCOM International Workshop on Graph Drawing 1993.
ALCOM, 1993.
- [17]
- Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and
Ioannis G. Tollis.
Algorithms for drawing graphs: an annotated bibliography.
Report, June 1993.
- [18]
- Giuseppe Di Battista, Peter Eades, Roberto Tamassia, and
Ioannis G. Tollis.
Algorithms for drawing graphs: an annotated bibliography.
Report, Brown University, June 1994.
available via FTP at
ftp://wilma.cs.brown.edu/pub/papers/compgeo/gdbiblio.tex.Z.
- [19]
- B. Becker and
G. Hotz.
On the optimal layout of planar graphs with fixed boundary.
SIAM Journal of Computing, 16:946-972, 1987.
referenced in KamKaw:89:General.
- [20]
- M. Behzad, G. Chartrand, and L. Lesniak-Foster.
Graphs and Digraphs.
Prindle, Weber&Schmidt, Boston, Mass., 1979.
- [21]
- Bertolazzi, Cohen, Di Battista, Tamassia, and Tollis.
How to draw a series-parallel digraph (extended abstract).
In Scandinavian Workshop on Algorithm Theory, 1992.
- [22]
- P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia, and
I. G. Tollis.
How to draw a series-parallel digraph.
In Proc. 3rd Scand. Workshop Algorithm Theory, volume 621 of
Lecture Notes in Computer Science, pages 272-283. Springer-Verlag,
1992.
- [23]
- Bertolazzi, Di Battista, Mannino, and Tamassia.
Optimal upward planarity testing of single-source digraphs.
In Annual European Symposium on Algorithms, 1993.
- [24]
- D. Bienstock.
Some provably hard crossing number problems.
In Proceedings of the 8th Annual ACM Symposium on Computational
Geometry, pages 253-360, 1990.
- [25]
- R. B. Boppana.
Eigenvalues and graph bisection: a average case analysis.
In Proc. of the 28th Annual Symposium on Computer Science, pages
280-285. IEEE, 85.
- [26]
- F.J.
Brandenburg.
Layout graph grammars: The placement approach.
In Graph Grammars and their Application to Computer Science, number
532 in LNCS, Berlin, 1991. Springer Verlag.
- [27]
- F.J.
Brandenburg.
Designing graph drawings by layout graph grammars.
In Graph Drawing DIMACS International Workshop GD '94, number 894 in
LNCS, pages 416-427. Springer, 1994.
- [28]
- Franz Brandenburg,
editor.
Proceedings of Graph Drawing'95, Lecture Notes in Computer Science,
Passau, September 1995.
to appear.
- [29]
- Ingo W. Bruß.
Konzeption und Realisierung einer Visualisierungskomponente für komplexe
Datenstrukturen unter dem Werkzeug CAKETool.
Master's thesis, Universität Karlsruhe, 1995.
- [30]
- Frank
Buschmann, editor.
Workshop Entwurfsmuster, December 1994.
- [31]
- W. J.
Camp, S. J. Plimpton, B.A. Hendrickson, and R. W. Leland.
Massively parallel methods for engineering and science problems.
Comm. of the ACM, pages 31-41, April 1994.
- [32]
- M. Carpano.
Automatic display of hierarchized graphs for computer-aided decision analysis.
IEEE Transactions on Systems, Man and Cybernetics, SMC-10:705-715,
1980.
referenced in KamKaw:89:General.
- [33]
- N. Chiba,
T. Nishizeki, Abe, and Ozawa.
A linear algorithm for embedding planar graphs using pq-tree algorithms.
Journal of Computer and System Sciences, 30(1):54-76, 1985.
- [34]
- R. F.
Cohen, G. Di Battista, R. Tamassia, I. G. Tollis, and P. Bertolazzi.
A framework for dynamic graph drawing.
In Proc. 8th Annu. ACM Sympos. Comput. Geom., pages 261-270, 1992.
- [35]
- R. F. Cohen,
P. Eades, T. Lin, and F. Ruskey.
Three-dimensional graph drawing.
In Tamassia and Tollis [123], pages 1-11.
- [36]
- D.G.
Corneil and C.C. Gotlieb.
An efficient algorithm for graph isomorphism.
Journal of the ACM, 17:51-64, 1970.
- [37]
- Isabel Cruz and
Ashim Garg.
Drawing graphs by example efficiently: Trees and planar acyclic digraphs.
In Tamassia and Tollis [123], pages 404-415.
- [38]
- Isabel F.
Cruz and Roberto Tamassia.
How
to visualize a graph: Specification and algorithms, 1994.
- [39]
- I. F. Cruz.
Doodle: A visual language for object-oriented databases.
In Proc. ACM SIGMOD Conf., page 71, San Diego, CA, June 1992.
- [40]
- R. Davidson and David Harel.
Drawing graphs nicely using simulated annealing.
Technical Report CS89-13, Department of Applied Mathematics and Computer
Science, The Weizmann Institute of Science, Rehovot, Israel, 1989.
revised July 1993, to appear in Communications of the ACM.
- [41]
- H. de Fraysseix, Pach, and Pollack.
How to draw a planar graph on a grid.
Combinatorica, 10:41-51, October 1990.
- [42]
- Giuseppe di Battista, Giuseppe Liotta, and Francesco Vargiu.
Diagram server.
Journal of Visual Languages and Computing, 6:275-298,
1995.
Diagram Server is a network server for client applications
that use diagrams for interacting with the users; it offers to its clients
effective facilities to represent and manage diagrams. The main features of
Diagram Server are the following: (1) independence between the client
application and Diagram Server, (2) capability of providing the client
application with graph drawing algorithms automatically selected from a very
large set of algorithms, (3) management of multiple representations of the
same schema, (4) management of a multi-user environment, (5) interaction with
the client applications by means of a message passing technique. Diagram
Server can be fully customized according to different application contexts
and graphic environments.
- [43]
- Peter Eades and
K. Sugiyama.
How to draw a directed graph.
Journal of Information Processing, 14(4):424-437, 1990.
- [44]
- P. Eades
and R. Tamassia.
Algorithms for automatic graph drawing: An annotated bibliography.
Technical Report 82, Dept. Comput. Sci., University of Queensland, Australia,
1987.
- [45]
- P. Eades
and R. Tamassia.
Algorithms for drawing graphs: An annotated bibliography.
Report CS-89-09, Dept. Comput. Sci., Brown Univ., Providence, RI, February
1989.
- [46]
- Eades and
Wormald.
Edge crossings in drawings of bipartite graphs.
Algorithmica, 11, 1994.
- [47]
- P. Eades.
A heuristic for graph drawing.
Congressus Numerantium, 42:149-160, 1984.
- [48]
- Kim M. Fairchild, Steven E. Poltrock, and George W. Furnas.
SemNet: Three-Dimensional Graphic Representations of Large Knowledge
Bases, chapter 5.
Lawrence Erlbaum associates, 1988.
- [49]
- C. J. Fisk,
D. L. Caskey, and L. E. West.
ACCEL: Automated circuit card etching layout.
Proceedings of the IEEE, 55(11):1971-1982, November 1967.
- [50]
- Ulrich
Fößmeier and Michael Kaufmann.
Drawing high degree graphs with low bend numbers.
In Brandenburg [28].
to appear.
- [51]
- Michael
Fröhlich and Mattias Werner.
Giotto --- graphische darstellung strukturierter objekte.
Diplomarbeit, Universität Bremen, Postfach 330 440, D-28334 Bremen, 1992.
- [52]
- Michael Fröhlich and Mattias Werner.
Anforderungen an das visualisierungssystem davinci.
daVinci, Anforderungsanalyse, Januar 1993.
- [53]
- Michael Fröhlich and Mattias Werner.
daVinci V1.2 Transition Guide.
Universität Bremen, Fachbereich Mathematik & Informatik, Postfach 330 440,
D-28334 Bremen, first printing: 1993-10-26 edition, Oktober 1993.
differences to V1.1.
- [54]
- Michael Fröhlich and Mattias Werner.
daVinci V1.2 User Manual.
Universität Bremen, Fachbereich Mathematik & Informatik, Postfach 330 440,
D-28334 Bremen, first printing: 1993-10-26 edition, Oktober 1993.
menu description, Commands to Application Interface.
- [55]
- Fröhlich and Werner.
Demonstration of the interactive graph-visualization system davinci.
In Tamassia and Tollis [123].
- [56]
- M. Fröhlich and M. Werner.
The
graph visualization system daVinci - A user interface for
applications.
Technical Report 5/94, Department of Computer Science; University of Bremen,
September 1994.
- [57]
- T.M.J.
Fruchterman and E.M. Reingold.
Graph drawing by force-directed placement.
Software-Practice and Experience, 21, 1991.
- [58]
- Emden R.
Gansner, Stephen C. North, and Kiem-Phong Vo.
Dag --- a program that draws directed graphs.
Software --- Practice and Experience, 18(11):1047-1062, November
1988.
- [59]
- E. R.
Gansner, S.C. North, and K.P. Vo.
Dag --- a program that draws directed graphs.
Technical report, AT&T Bell Laboratories, Murray Hill, New Jersey 07974, 1989.
revised June 11, 1989.
- [60]
- Emden R. Gansner, Eleftherios Koutsofios, Stephen C. North, and
Kiem-Phong Vo.
A technique for drawing directed graphs.
IEEE Transactions on Software Engineering, 19(3):214-230, March
1993.
- [61]
- M.R. Garey and
D.S. Johnson.
Crossing number is NP-complete.
SIAM Journal of Algebraic and Discrete Methods, 4(3):312-316,
1983.
- [62]
- A. Garg and
R. Tamassia.
On the computational complexity of upward and rectilinear planarity testing.
In Graph Drawing DIMACS International Workshop GD '94, number 894 in
LNCS, pages 286-298. Springer, 1994.
- [63]
- Ashim Garg.
On drawing angle graphs.
In R. Tamassia and I. Tollis, editors, Graph Drawing DIMACS International
Workshop GD '94, number 894 in LNCS, pages 84-95. Springer, 1994.
- [64]
- Frank Harary.
Graph Theory.
Series in Mathematics. Addison Wesley Publishing Company, 1969.
- [65]
- D. Harel and
M. Sardas.
Randomized graph drawing with heavy-duty preprocessing.
Technical Report CS93-16, Department of Applied Mathematics and Computer
Science, The Weizmann Institute of Science, Rehovot, Israel, 1993.
- [66]
- Michael Himsolt, Brandan Madden, Patrick Madden, and Steve
Powers.
Portable graph layout and editing (system demonstration).
In Brandenburg [28].
to appear.
- [67]
- M. Himsolt.
Graphed: An interactive graph editor.
In Annual Symposium on Theoretical Aspects of Computer Science, volume
349 of LNCS, Berlin, Heidelberg, New York, 1989. Springer Verlag.
- [68]
- M. Himsolt.
Graphed user manual.
Technical report, Fakultät für Informatik, Universität Passau, Innstraße 33,
D-8390 Passau, 1992.
- [69]
- M. Himsolt.
A view to graph drawing algorithms through mathrmGraph^Ed.
In Graph Drawing '93, ALCOM International Workshop PARIS 1993 on Graph
Drawing and Topological Graph Algorithms, September 1993.
- [70]
- Michael Himsolt.
Graphed: A graphical platform for the implementation of graph algorithms.
In Tamassia and Tollis [123].
- [71]
- IEEE Computer Society.
IEEE Computer Science Press, 1990.
- [72]
- IEEE Computer Society.
IEEE Computer Science Press, October 1991.
- [73]
- IEEE Computer Society.
IEEE Computer Science Press, September 1992.
- [74]
- IEEE Computer Society.
IEEE Computer Science Press, August 1993.
- [75]
- J.G.Vaucher.
Pretty-printing of trees.
Software -- Practice and Experience, 10:--561, 1980.
Trees, Drawing, Pretty-Print.
- [76]
- D.S. Johnson.
The NP-completeness column: an ongoing guide.
Journal of Algorithms, 3(1):89-99, 1982.
- [77]
- D.S. Johnson.
The NP-completeness column: an ongoing guide.
Journal of Algorithms, 5(2):147-160, 1982.
- [78]
- N. R. Quinn Jr. and
M. A. Breuer.
A forced directed component placement procedure for printed circuit boards.
IEEE Transactions on Circuits and Systems, CAS-26(6):377-388,
1979.
- [79]
- T. Kamada and
S. Kawai.
An enhanced treatment of hidden lines.
ACM Transactions on Graphics, 6(4):308-323, October 1987.
- [80]
- T. Kamada and
S. Kawai.
Advanced graphics for visualization of shielding relations.
Computer Vision, Graphics, and Image Processing, 43:294-312, 1988.
- [81]
- T. Kamada
and S. Kawai.
Automatic display of network structures for human understanding.
Technical Report 88-7, Dep. Inf. Sci., University of Tokyo, Japan, 1988.
- [82]
- T. Kamada and
S. Kawai.
A simple method for computing general position in displaying three-dimensional
objects.
Computer Vision, Graphics, and Image Processing, 41:43-56, 1988.
- [83]
- T. Kamada and
S. Kawai.
An algorithm for drawing general undirected graphs.
Information Processing Letters, 31, 1989.
- [84]
- G. Kant.
Algorithms for Drawing Planar Graphs.
PhD thesis, Universiteit Utrecht, Faculteit Wiskunde en Informatica, 1993.
ISBN 90-393-0416-5.
- [85]
- B.W.
Kernighan and S. Lin.
An effective heuristic procedure for partitioning graphs.
The Bell System Technical Journal, pages 291-308, February 1970.
- [86]
- Can Keskin.
Kombination von schneller heuristiken mit constraint-verfahren zur erzeugung
von graphen-layouts in 3-d.
Studienarbeit, Universität Karlsruhe, 1995.
- [87]
- E. Koutsofios and S.C. North.
Drawing graphs with dot.
Technical Report 910904-59113-08TM, AT&T Bell Laboratories, Murray Hill, NJ,
September 1991.
dot User's Manual.
- [88]
- E. Koutsofios and S.C. North.
Drawing graphs with dot.
Technical report, AT&T Bell Laboratories, Murray Hill, NJ, 1993.
- [89]
- Joseph B.
Kruskal and Judith B. Seery.
Designing network diagrams.
In Proceedings of the First General Conference on Social Graphics,
pages 22-50, Washington, D.C., July 1980. U. S. Department of the Census.
Bell Laboratories Technical Report No. 49.
- [90]
- L.B.Protsko, P. G. Sorenson, J. P. Tremblay, and D.A. Schaefer.
Towards the automatic generation of software diagrams.
IEEE Transactions on Software Engineering, 17(1):--21, January 1991.
Drawing,Diagram.
- [91]
- A. Lempel, S. Even, and I. Cederbaum.
An algorithm for planarity testing of graphs.
In P. Rosenstiehl, editor, Theory of Graphs, International Symposium.
Gordon and Breach, New York, 1967.
- [92]
- T. Lin and
P. Eades.
Integration of declarative and algorithmic approaches for layout creation.
In Proceedings of Graph Drawing'94, LNCS. DIMACS, Springer, 1994.
to appear. The statement was made by P. Eades in his talk.
- [93]
- Richard J.
Lipton, Steven C. North, and J.S. Sandberg.
A method for drawing graphs.
In Proc. ACM Symposium on Computational Geometry, pages 153-160, June
1985.
- [94]
- J.B. Manning.
Geometric symmetry in graphs.
PhD thesis, Purdue University, December 1990.
- [95]
- Matsuoka, Kamada, and Kawai.
Asymptotic evaluation of window visibility.
Information Processing Letters, 31, 1989.
- [96]
- C.L.
McCreary and Fwu-Shan Shieh.
Using graph parsing for automatic graph drawing.
Technical report, Auburn University, 1995.
This paper presents a
procedure for automatically drawing directed graphs. Our system, CG, uses a
unique clan-based graph decomposition to determine intrinsic substrucutres
(clans) in the graph and to produce a parse tree.
- [97]
- Cathleen McGrath, Jim Blythe, and David Krackhardt.
The effect of graph layout on inference from social network data.
In Brandenburg [28].
to appear.
- [98]
- Z. Miller
and J.B. Orlin.
NP-completeness for minimizing maximum edge length in grid embeddings.
Journal of Algorithms, 6(1):10-16, 1985.
- [99]
- Kazuo
Misue, Peter Eades, Wei Lai, and Kozo Sugiyama.
Layout adjustment and the mental map.
Journal of Visual Languages and Computing, 6:183-210,
1995.
This paper discusses some layout adjustment methods and the
preservation of the `mental map' of the diagram. First, several models are
proposed to make the concept of `mental map' more precise. Then two kinds of
layout adjustments are described. One is an algorithm for rearranging a
diagram to avoid overlapping nodes, and the other is a method aimed at
changing the focus of interest of the user without destroying the mental map.
Next, some experience with visualization systems in which the techniques have
been employed is also described.
- [100]
- Erkki
Mäkinen and Mika Sieranta.
Genetic algorithms for drawing bipartite graphs.
Report A-1994-1, University of Tampere, 1994.
- [101]
- Sven Moen.
Drawing dynamic trees.
IEEE Software, ??(7):21-28, July 1990.
- [102]
- Burkhard Monien, Friedhelm Ramme, and Helmut Salmen.
A parallel simulated annealing algorithm for generating 3D layouts of
undirected graphs.
In Brandenburg [28].
to appear.
- [103]
- Frances
Newbery-Paulisch and Walter F. Tichy.
Edge: An extendible graph editor.
Software -- Practic and Experience, 20(S1):S1/63-S1/88, June 1990.
Edge.
- [104]
- T. Nishizeki and N. Chiba.
Planar Graphs: Theory and Algorithms.
Number 32 in Annals of Discrete Mathematics. North Holland, 1988.
- [105]
- A. Pothen, H. D. Simon, and K.-P. Liou.
Partitioning sparse matrices with eigenvectors of graphs.
Siam J. Matrix Anal. Appl., 11(3):430-452, July 1990.
- [106]
- ACM.
Proceedings of the 1986 ACM SIGCHI Conference on Human Factors in Computing
Systems. ACM Press, 1986.
- [107]
- IEEE Computer
Society.
Proceedings of the 1987 IEEE Workshop on Visual Languages. IEEE
Computer Science Press, 1987.
- [108]
- IEEE.
Proceedings of the 1994 IEEE Visualization '94 conference, October
1994.
- [109]
- Helen C. Purchase, Robert F. Cohen, and Murray I. James.
Validating graph drawing æsthetics.
In Proceedings of GD'95, 1995.
- [110]
- Edward S.
Reingold and John S. Tilford.
Tidier drawings of trees.
IEEE Transactions on Software Engineering, SE-7(2):223-228, March
1981.
Drawing,Trees.
- [111]
- S.P. Reiss.
3-D Visualization of Program Information.
In R. Tamassia and I. Tollis, editors, Graph Drawing DIMACS International
Workshop GD '94, number 894 in LNCS, pages 12-24. Springer Verlag,
1994.
- [112]
- Steven P. Reiss.
An engine for the 3d visualization of program information.
Journal of Visual Languages and Computing, 6:299-323,
1995.
We have a project currently underway that attempts to use 3D
workstations to provide insight into programs, their structure and their
execution, through the use of a variety of user-definable displays. We offer
a variety of different presentation styles and utilize a variety of different
layout methods and heuristics. This paper describes the underlying engine
that we have developed to support this range of presentations.
- [113]
- L.A. Rowe,
M.Davis, E. Messinger, C.Meyer, C. Spirakis, and A. Tuan.
A browser for directed graphs.
Software -- Practic and Experience, 17(1):61-76, January 1987.
Graph,Drawing,Browser.
- [114]
- Sander.
Graph layout through the VCG tool.
In Tamassia and Tollis [123], pages 194-205.
- [115]
- Schnyder.
Embedding planar graphs on the grid.
In ACM-SIAM Symposium on Discrete Algorithms (A Conference on Theoretical
and Experimental Analysis of Discrete Algorithms), 1990.
- [116]
- H. Stamm-Wilbrandt.
A simple linear-time algorithm for embedding maximal planar graphs.
In Graph Drawing '93, ALCOM International Workshop PARIS 1993 on Graph
Drawing and Topological Graph Algorithms, September 1993.
- [117]
- K. Sugiyama, S. Tagawa, and M. Toda.
Methods for visual understanding of hierarchical system structures.
IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2):109-125,
February 1981.
Layout,Drawing.
- [118]
- Sugiyama and Misue.
Visualization of structural information.
IEEE Transactions on Systems, Man and Cybernetics, SMC-21(4):876-892,
1991.
- [119]
- K. Sugiyama.
Achieving uniqueness requirement in drawing digraphs: optimum code algorithm
and hierarchy isomorphism.
Research Report 58, IIAS-SIS, Fujitsu, Japan, 1985.
- [120]
- K.J.
Supowit and E. Reingold.
The complexity of drawing trees nicely.
Acta Informatica, 18:377-392, 1983.
- [121]
- Roberto Tamassia, Giuseppe Di Battista, and C. Batini.
Automatic graph drawing and readability of diagrams.
IEEE Transactions on Systems, Man and Cybernetics, 18(1):--79,
Jan./Feb. 1988.
Graph,Layout,Drawing.
- [122]
- Tamassia,
Tollis, and Vitter.
Lower bounds for planar orthogonal drawings of graphs.
Information Processing Letters, 39, 1991.
- [123]
- Roberto
Tamassia and Ioannis Tollis, editors.
Proceedings of Graph Drawing'94, volume 894 of Lecture Notes in
Computer Science, Princeton, New Jersey, October 10-12 1994. DIMACS
Workshop on Graph Drawing, Springer Verlag.
- [124]
- Roberto Tamassia.
On embedding a graph in the grid with the minimum number of bends.
SIAM J. of Comput., 16(3):421-444, June 1987.
- [125]
- Walter F.
Tichy and Frances J. Newbery.
Knowledge-based editors for directed graphs.
In Edge [103], pages 101-109.
referenced in Froehlich:93:Anforderungen.
- [126]
- D. Tunkelang.
An aesthetic layout algorithms for undirected graphs.
Master's thesis, MIT, 1993.
- [127]
- D. Tunkelang.
A layout algorithm for undirected graphs.
In Graph Drawing '93, ALCOM International Workshop PARIS 1993 on Graph
Drawing and Topological Graph Algorithms, September 1993.
- [128]
- W.T. Tutte.
How to draw a graph.
Proc. London Math. Soc., 3:743-768, 1963.
gd-sem vorh.
- [129]
- J.Q. Walker
II.
A node-positioning algorithm for general trees.
Software -- Practic and Experience, 20(7):--705, July 1990.
Tree,Drawing,Node,Positioning.
- [130]
- J.N. Warfield.
Crossing theory and hierarchy mapping.
IEEE Transactions on Systems, Man and Cybernetics, SMC-7:505-523,
1977.
referenced in KamKaw:89:General; argues for reducing number of edge crossings
in graphs.
- [131]
- H. Watanabe.
Heuristic graph displayer for G-Base.
Technical Report TR-17, Ricoh Software Research Center, Tokyo, Japan, 1988.
adds one vertex at a time.
- [132]
- H. Watanabe.
Heuristic graph displayer for G-Base.
International Journal of Man-Machine Studies, 30:287-302, 1989.
- [133]
- Wetherell and Shannon.
Tidy drawing of trees.
IEEE Transactions on Software Engineering, SE-5(5):514-520, 1979.
- [134]
- D. Woods.
Drawing planar graphs.
Ph.D. dissertation Tech. Report STAN-CS-82-943, Stanford University, Stanford,
California, 1982.
- [135]
- Gaby Zinssmeister and C. McCreary.
Drawing graphs with attribute graph grammars.
In Graph Grammar Workshop, pages 355-360, Williamsburg, 1994.
Arne Frick
Last modified: Sun Jan 21 00:52:27 MET 1996