Graph drawing methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1115, Issue , 1996, Pages 40-49

  Eades, P ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION;

AS GRAPH; GRAPH DRAWING; GRAPH DRAWING METHODS; PAPER SURVEYS;

DRAWING (GRAPHICS);

EID: 84955617343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61534-2_3     Document Type: Conference Paper

References (64)

1. C. Batini, L. Furlani, and E. Nardelli. What is a good diagram? A pragmatic approach. In Proc. 4th Internat. Conf. on the Entity Relationship Approach, 1985.
2. C. Batini, E. Nardelli, M. Talamo, and R. Tamassia. A graph theoretic approach to aesthetic layout of information systems diagrams. In Proc. 10th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (Berlin June 1984), pages 9-18, Linz, Austria, 1984. Trauner Verlag.
3. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: An annotated bibliography. Computational Geometry: Theory and Applications, 4:235-282, 1994. currently available from wilma.cs.brown.edu by ftp.
4. F. J. Brandenburg. Designing graph drawings by layout graph grammars. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 416-427. Springer-Verlag, 1995.
5. I. Bruss and A. Frick. Fast interactive 3d graph visualization. In Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 99-110. Springer, 1995.
6. R. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. In Graph Drawing 94, volume 894 of Lecture Notes in Computer Science, pages 1-11. Springer, 1994.
7. I. Cruz and J. Twarog. 3d graph drawing with simluated annealing. In Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 162-165. Springer, 1995.
8. I. F. Cruz. Using a visual constraint language for data display specification. In P. C. Kanellakis, J.-L. Lassez, and V. Saraswat, editors, First Workshop on Principles and Practice of Constraint Programming, Newport, RI, April 1993.
9. I. F. Cruz and A. Garg. Drawing graphs by example efficiently: Trees and planar acyclic digraphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 404-415. Springer-Verlag, 1995.
10. I. F. Cruz, R. Tamassia, and P. Van Hentenryk. A visual approach to graph drawing. In Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing), Paris, France, September 1993.
11. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. Commun. ACM. To appear.
12. R. Davidson and D. Harel. Drawing graphs nicely using simulated aneealing. Technical report, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, 1989.
13. E. Dengler, M. Friedell, and J. Marks. Constraint-driven diagram layout. In Proc. IEEE Sympos. on Visual Languages (VL '93), pages 330-335, 1993.
14. P. Eades. A heuristic for graph drawing. Congr. Numer., 42:149-160, 1984.
15. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combin., 21A:89-98, 1986.
16. P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics 91, pages 24-33, 1991.
17. P. Eades, W. Lai, K. Misue, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6:183-210, 1995.
18. P. Eades and T. Lin. Algorithmic and declarative approaches to aesthetic layout. In Graph Drawing '93 (Proc. ALCOM Workshop on Graph Drawing), Paris, France, September 1993.
19. P. Eades and X. Lin. Notes on the layer assignment problem for drawing directed graphs. In ACSC 14: Proceedings of the 14th Australian Computer Science Conference, pages 26-1-26-10, 1991.
20. P. Eades and X. Lin. A new heuristic for the feedback arc set problem. Australian Journal of Combinatorics, 12:15-26, 1995.
21. P. Eades and N. Wormald. Edge crossings in drawings of bipartite graphs. Technical Report 108, Department of Computer Science, University of Queensland, to appear in Algorithmica.
22. A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 388-403. Springer-Verlag, 1995.
23. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw.-Pract. Exp., 21(11):1129-1164, 1991.
24. E. R. Gansner, E. Koutsofios, S. C. North, and K P Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19:214-230, 1993.
25. E.R. Gansner, S.C. North, and K.P. Vo. Dag-a program that draws directed graphs. Software-Practice and Experience, 18(11):1047-1062, 1988.
26. M. R. Garey and D. S. Johnson. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods, 4(3):312-316, 1983.
27. J. Cai, X. Han and R. E. Tarjan. An 0(mlog n)-time algorithm for the maximal subgraph problem. SIAM J. Comput., 22:1142-1162, 1993.
28. D. Harel. On visual formalisms. Communications of the ACM, 31(5):514-530, 1988.
29. M. Himsolt. Graphed: An interactive graph editor. In Proc. STACS 89, volume 349 of Lecture Notes in Computer Science, pages 532-533, Berlin, 1989. Springer-Verlag.
30. M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. J. Visual Languages and Computing, 6(3), 1995. (special issue on Graph Visualization, edited by I. F. Cruz and P. Eades).
31. M. Himsolt. GraphEd: a graphical platform for the implementation of graph algorithms. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 182-193. Springer-Verlag, 1995.
32. R. Jayakumar, K. Thulasiraman, and M. N. S. Swamy. An optimal algorithm for maximal planarization of nonplanar graphs. In Proc. IEEE Internat. Sympos. on Circuits and Systems, pages 1237-1240, 1986.
33. M. Juenger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica. (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia, to appear).
34. T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science, 1989.
35. T. Kamada and S. Kawai. Automatic display of network structures for human understanding. Technical Report 88-007, Department of Information Science, University of Tokyo, 1988.
36. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Inform. Process. Lett., 31:7-15, 1989.
37. H. Koike. An application of three dimensional visualization to object-oriented programming. In Advanced Visual Interfaces (Proceedings of AVI 92), volume 36 of World Scientific Series in Computer Science, pages 180-192, 1992.
38. C. Kosak and J. Marks. A parallel genetic algorithm for network-diagram layout. In Proc. 4th Int. Conf. on Genetic Algorithms (ICGA91), 1991.
39. Wei Lai. Building Interactive Diagram Applications. PhD thesis, University of Newcsastle, 1993.
40. T. Lin. Diagram User Interfaces. PhD thesis, University of Newcastle, 1993.
41. T. Lin and P. Eades. Integration of declarative and algorithmic approaches for layout creation. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 376-387. Springer-Verlag, 1995.
42. X. Mendonca. A System for Drawing Conceptual Scheme Diagrams. PhD thesis, University of Queensland, 1994.
43. E. B. Messinger. Automatic layout of large directed graphs. Technical Report 88-07-08, Department of Computer Science, University of Washington, 1988.
44. E. B. Messinger, L. A. Rowe, and R. H. Henry. A divide-and-conquer algorithm for the automatic layout of large directed graphs. IEEE Trans. Syst. Man Cybern, SMC, 21(1):1-12, 1991.
45. K. Misue and K. Sugiyama. An overview of diagram based idea organizer: D-abductor. Technical Report IIAS-RR-93-3E, ISIS, Fujitsu Laboratories, 1993.
46. B. Monien, F. Ram me; and H. Salmen. A parallel simulated annealing algorithm for generating 3d layouts of undirected graphs. In Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 396-408. Springer, 1995.
47. F. Newbery Paulish and W.F. Tichy. Edge: An extendible graph editor. Software-Practice and Experience, 20(Sl):l/63-Sl/88, 1990. also as Technical Report 8/88, Fakultat fur Informatik, Univ. of Karlsruhe, 1988.
48. H. Purchase, R. Cohen, and M. James. Validating graph drawing aesthetics. In Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 435-446. Springer, 1995.
49. R. Cohen, Q-W. Feng and P. Eades. How to draw a planar clustered graph. In Computing and Combinatorics, volume 959 of Lecture Notes in Computer Science, pages 21-30. Springer, 1995.
50. R. Cohen, Q-W. Feng and P. Eades. Planarity for clustered graphs. In Algorithms-ESA95, volume 979 of Lecture Notes in Computer Science, pages 213-226. Springer, 1995.
51. S. P. Reiss. A framework for abstract 3d visualization. In Proc. IEEE Sympos. on Visual Languages (VL '93), 1993.
52. S. P. Reiss. 3-D visualization of program information. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 12-24. Springer-Verlag, 1995.
53. S. P. Reiss. An engine for the 3D visualization of program information. J. Visual Languages and Computing, 6(3), 1995. (special issue on Graph Visualization, edited by I. F. Cruz and P. Eades).
54. G. Sander. Graph layout through the VCG tool. In R. Tamassia and I. G. Tollis, editors, Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes in Computer Science, pages 194-205. Springer-Verlag, 1995.
55. Tom Sawyer Software. Graph layout toolkit. available from bmad-den@TomSawyer.COM.
56. M. Storey and H. Mueller. Graph layout adjustment strategies. In Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 487-489. Springer, 1995.
57. K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Software Engineering, 21(4):876-892, 1991.
58. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern, SMC, 11(2):109-125, 1981.
59. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput, 16(3):421-444, 1987.
60. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern, SMC, 18(l):61-79, 1988.
61. R. Tamassia and I.G. Tollis. A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry, 1(4):321-341, 1986.
62. H. Trickey. Drag: A graph drawing system. In Proc. Internat. Conf. on Electronic Publishing, pages 171-182. Cambridge University Press, 1988.
63. W. T. Tutte. How to draw a graph. Proceedings London Mathematical Society, 13(3):743-768, 1963.
64. J. Warfield. Crossing theory and hierarchy mapping. IEEE Trans. Syst. Man Cybern, SMC, 7(7):502-523, 1977.