Skip to main content
SpringerLink
Log in

Drawing graphs with attribute graph grammars

  • Patterns and Graphics
  • Conference paper
  • First Online:
Graph Grammars and Their Application to Computer Science (Graph Grammars 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1073))

Abstract

We address the problem of automatically generating layouts for graphs using graph grammars.

The central idea of our approach to graph layout is viewing layout algorithms as attribute evaluators of attribute graph grammars, thus a layout algorithm is an attribute scheme plus an attribute evaluator. The main advantages are that we make use of the intrinsic structure of graphs to subdivide the layout problem and that different layouts can be specified simply with different attribute schemes for the same graph grammar.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.-J. Brandenburg. Graph Grammatiken. Script to a lecture, summer semester '89, 1990.

    Google Scholar 

  2. F. J. Brandenburg. Layout Graph Grammars: The Placement Approach. In Ehrig et al. [8], pages 144–156.

    Google Scholar 

  3. F. J. Brandenburg. The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. In R. V. Book, editor, Rewriting Techniques and Applications, 4th Int. Conf., Como, Italy, pages 312–322. Springer, 1991.

    Google Scholar 

  4. M.-J. Carpano. Automatic Display of Hierarchized Graphs for Computer-Aided Decsision Analysis. IEEE Trans. on Systems, Man, and Cybernetics, SMC-10(11):705–715, Nov. 1980.

    Google Scholar 

  5. B. Courcelle. An Axiomatic Definition of Context-Free Rewriting and its Application to NLC-Graph Grammars. Theoretical Comput. Sci., 55(2/3):141–182, 1987.

    Google Scholar 

  6. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms For Drawing Graphs: an Annotated Bibliography. Technical report, Brown University, Providence, RI 02912-1910, USA, 1993. Avail. via anonymous ftp from http://www.wilma.cs.brown.edu, file /pub/gdbiblio.tex.Z.

    Google Scholar 

  7. A. Ehrenfeucht and G. Rozenberg. Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms. Theoretical Comput. Sci., 70(3):277–303, Feb. 1990.

    Google Scholar 

  8. H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Graph-Grammars and Their Application to Computer Science, 1990. LNCS 532. Springer, 1991.

    Google Scholar 

  9. D. H. Gill, T. J. Smith, T. E. Gerasch, J. V. Warren, C. L. McCreary, and R. E. K. Stirewalt. Spatial — Temporal Anaylsis of Program Dependence Graphs for Useful Parallelism. Journ. of Parallel and Distr. Comp., 19(2):103–118, Oct. 1993.

    Google Scholar 

  10. M. Kaul. Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken. Technical Report MIP-8610, Univ. Passau, 1986. (Dissertation).

    Google Scholar 

  11. T. Lamshöft. Ein Parser für Graphgrammatiken. Master's thesis, Univ. Passau, FB Informatik, 1993.

    Google Scholar 

  12. U. Lichtblau. Recognizing Rooted Context-Free Flowgraph Languages In Polynomial Time. In Ehrig et al. [8], pages 538–548.

    Google Scholar 

  13. C. McCreary. An Algorithm for Parsing a Graph Grammar. PhD thesis, Univ. of Colorado, 1987.

    Google Scholar 

  14. M. Minas and G. Viehstaedt. Specification of Diagram Editors Providing Layout Adjustment with Minimal Changes. In IEEE Workshop on Visual Languages, Bergen, Norway, pages 324–329, Los Alamitos, CA, 1993. IEEE Computer Society Press.

    Google Scholar 

  15. S. Moen. Drawing Dynamic Trees. IEEE Software, 7(4):21–28, July 1990.

    Google Scholar 

  16. E. M. Reingold and J. S. Tilford. Tidier Drawings of Trees. IEEE Trans. Softw. Eng., SE-7(2):223–228, Mar. 1981.

    Google Scholar 

  17. A. Schütte. Spezifikation und Generierung von Übersetzern für Graph-Sprachen durch attributierte Graph-Grammatiken. Reihe Informatik. EXpress Edition, Berlin, 1987. (Dissertation).

    Google Scholar 

  18. J. D. Ullman. Computational Aspects of VLSI, chapter 3 Layout Algorithms, pages 80–130. Computer Science Press, 1984.

    Google Scholar 

  19. J. Valdes, R. E. Tarjan, and E. L. Lawler. The Recognition of Series Parallel Digraphs. SIAM J. Computation, 11(2):298–313, 1982.

    Google Scholar 

  20. G. Zinßmeister. Tree Layout by Attribute Graph Grammars. WSI-Fachbericht WSI-93-4, Univ. Tübingen, Wilhelm-Schickard-Institut, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut, Universität Tübingen, Sand 13, 72076, Tübingen, Germany

    Gaby Zinßmeister

  2. Dept. of Computer Science and Engineering, Auburn University, Auburn, AL, USA

    Carolyn L. McCreary

Authors
  1. Gaby Zinßmeister
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carolyn L. McCreary
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Janice Cuny Hartmut Ehrig Gregor Engels Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zinßmeister, G., McCreary, C.L. (1996). Drawing graphs with attribute graph grammars. In: Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1994. Lecture Notes in Computer Science, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61228-9_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-61228-9_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61228-5

  • Online ISBN: 978-3-540-68388-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation