Using graph parsing for automatic graph drawing

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 28, Issue 5, 1998, Pages 545-561

  McCreary, Carolyn L ^b   Chapman, Richard O ^a,c   Shieh, F S ^c  

^a IEEE

^b TUFTS UNIVERSITY   (United States)

^c AUBURN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS);

CLAN-BASED GRAPH DRAWING; GRAPH PARSING;

GRAPH THEORY;

EID: 0032164193     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/3468.709599     Document Type: Article

References (23)

1. F. J. Brandenburg, "Layout graph grammars: The placement approach," in Lecture Notes in Computer Science, 532, Graph Grammars and Their Application to Computer Science. Berlin, Germany: Springer-Verlag, 1991.
2. M. J. Carpano, "Automatic display of hierarchized graphs for computer aided decision analysis," IEEE Trans. Syst., Man, Cybern., vol. SMC-10, no. 11, pp 707-715, 1980.
3. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis, "Algorithms for drawing graphs: An annotated bibliography," available via ftp from wilma.cs.brown.edu (128.148.33.66) in file pub/papers/comp-geo/gdbiblio.tex.Z.
4. P. Eades and N. Wormald, "Edge crossings in drawings of bipartite graphs," Algorithmica, vol. 11, pp. 379-403, Apr. 1994.
5. A. Ehrenfeucht and G. Rozenberg, "Theory of 2-structures, part I: Clans, basic subclasses, and morphisms," Theoret. Comput. Sci., vol. 70, pp. 277-303, 1990.
6. _, "Theory of 2-structures, part II: Representation through labeled tree families," Theoret. Comput. Sci., vol. 70, pp. 305-342, 1990.
7. S. Enns, "Free-form curves on your micro," BYTE, vol. 11, pp. 225-230, Dec. 1986.
8. G. Farin, Curves and Surfaces for Computer Aided Geometric Design. Boston, MA: Academic, 1988.
9. L. C. Freeman and D. R. White, "Using Galois lattices to represent network data," in Sociological Methodology 1993, P. V. Marsden, Ed. Oxford, U.K.: Blackwell, 1993, pp. 127-146.
10. E. R. Gansner, S. C. North, and K. P. Vo, "DAG - A program that draws directed graphs," Software - Practice and Experience, vol. 18, pp. 1047-1062, Nov. 1988.
11. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo, "A technique for drawing directed graphs," IEEE Trans. Softw. Eng., vol. 19, no. 3, pp. 214-230, 1993.
12. M. Himsolt, "A view to graph drawing algorithms through GraphEd," in Proc. ALCOM Int. Workshop Graph Drawing, 1993, pp. 80-81.
13. R. Joobbani, An Artificial Intelligence Approach to VLSI Routing. Boston, MA: Kluwer, 1986.
14. Koutsofios and S. North, "Drawing graphs with dot," Dot User's Manual, AT&T Bell Labs, Murray Hill, NJ, 1994.
15. C. L. McCreary and A. Reed, "A graph parsing algorithm and implementation," Tech. Rep. TR-93-04, Dept. Comput. Sci. Eng., Auburn Univ., Auburn, AL, 1993.
16. Layout Design and Verification, T. Ohtsuki, Ed. New York: North-Holland, 1986.
17. F. T. Sheldon and K. M. Kavi, "Position statement: Linking software failure behavior to specification characteristics II," in IEEE Proc. Int. Workshop Evaluation Techniques Dependable Systems, San Antonio, TX, Oct. 1995.
18. A. T. Sherman, VLSI Placement and Routing: The Pi Project. Berlin, Germany: Springer-Verlag, 1989.
19. K. Sugiyama, S. Tagawa, and M. Toda, "Methods for visual understanding of hierarchical system structures," IEEE Trans. Syst., Man, Cybern., vol. 11, pp. 109-125, Feb. 1981.
20. J. N. Warfield, "Crossing theory and hierarchy mapping," IEEE Trans. Syst., Man, Cybern., vol. 7, pp. 505-523, July 1977.
21. J. D. Ullman, Computational Aspects of VLSI. Rockville, MD: Computer Science, 1984, pp. 80-130.
22. J. Valdes, R. E. Tarjan, and E. L. Lawler, "The recognition of series parallel digraphs," SIAM J. Comput., vol. 11, pp. 298-313, May 1982.
23. G. Zinssmeister and C. McCreary, "Drawing graph with attribute graph grammars," in Graph Grammar Workshop, Williamsburg, VA, 1994, pp. 355-360.