Skip to main content
SpringerLink
Log in

Layout graph grammars: The placement approach

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

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

Abstract

Layout graph grammars are extensions of context-free graph grammars and are introduced as a tool for syntax directed constructions of graph layouts. The constructions are based on a layout specification of the productions, which are consistently transferred to the derivations. The layout specification consists of rules for a placement of the vertices and a partial routing of the edges. It specifies minimal distances between the vertices in X- or Y-dimension. These distances can be optimized according to some formal cost measures.

There is a very intuitive visual representation of the layout specifications, which stems from an elegant graphic representation of the graph grammar productions. Alternatively, the layout specifications are expressed in graph theoretic terms, and so are completely integrated into usual graph grammars.

The computation of optimal layouts of graphs is a well-known NP-complete problem, even for binary trees. Therefore, we design layout graph grammars which guarantee polynomial time constructions of optimal layouts of graphs. This is achieved by the restriction to polynomial graph grammars and layout specifications, which can be computed efficiently by an attributation technique. Hence, layout graph grammars are a new and powerful tool for efficient solutions of graph layout problems. They help jumping accross the NP-completeness barrier.

The support of this work by the DFG under grant Br835/1 and by the ESPRIT Basic Research Group ”Computing by Graph Transformations” is gratefully acknowledged.

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. S.N. Bhatt, S. S. Cosmadakis, ”The complexity of minimizing wire lengths in VLSI layouts”, Inform. Proc. Letters 25 (1987), 263–267

    Article  Google Scholar 

  2. F.J. Brandenburg, ”On polynomial time graph grammars” Lecture Notes in Computer Science 294 (1988), 227–236

    Google Scholar 

  3. F.J. Brandenburg, ”On the complexity of optimal drawings of graphs” Lecture Notes in Computer Science 411 (1990), 166–180

    Google Scholar 

  4. H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (Eds.), ”Graph Grammars and Their Application to Computer Science”, Lecture Notes in Computer Science 291 (1987)

    Google Scholar 

  5. S. Even, ”Graph Algorithms”, Computer Science Press (1979)

    Google Scholar 

  6. M.J. Fischer, M.S. Paterson, ”Optimal tree layout”, Proc. 12 ACM STOC (1980), 177–189

    Google Scholar 

  7. M.R. Garey, D.S. Johnson, ”Computers and Intractability: a Guide to the Theory of NP-Completeness”, Freeman and Company, San Francisco (1979)

    Google Scholar 

  8. A. Gregori, ”Unit-Length embedding of binary trees on a square grid” Inform. Proc. Letters 31 (1989), 167–173

    Article  Google Scholar 

  9. D. Janssens, G. Rozenberg, ”On the structure of node label controlled graph languages”, Inform. Sci. 20 (1980), 191–216

    Article  Google Scholar 

  10. D. S. Johnson, ”The NP-completeness column: An ongoing guide” J. Algorithms 3 (1982), 89–99

    Article  Google Scholar 

  11. M. Kaul, ”Practical Applications of Precedence Graph Grammars” Lecture Notes in Computer Science 291 (1987), 326–342

    Google Scholar 

  12. M. Kaul, ”Syntaxanalyse von Graphen bei Präzedenz-Graph-Grammatiken” Ph. D. Thesis and MIP-Bericht Universität Passau (1986).

    Google Scholar 

  13. Z. Miller, J.B. Orlin, ”NP-completeness for minimizing maximum edge length in grid embeddings”, J. Algorithms 6 (1985), 10–16

    Article  Google Scholar 

  14. G. Rozenberg, E. Welzl, ”Boundary NLC graph grammars — basic definitions, nornal forms and complexity”, Inform. Contr. 69 (1986), 136–137

    Article  Google Scholar 

  15. R. Schuster, ”Graph Grammatiken und Graph Einbettungen: Algorithmen und Komplexität”, Ph.D Thesis and MIP Bericht, Universität Passau (1987)

    Google Scholar 

  16. A.O. Slisenko, ”Context-free grammars as a tool for describing polynomial-time subclasses of hard problems”, Inform. Proc. Letters 14 (1982), 52–56

    Article  Google Scholar 

  17. J. D. Ullman, ”Computational Aspects of VLSI”, Computer Science Press (1984)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Informatik, University of Passau, Innstr. 33, D 8390, Passau, Germany

    Franz J. Brandenburg

Authors
  1. Franz J. Brandenburg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Ehrig Hans-Jörg Kreowski Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brandenburg, F.J. (1991). Layout graph grammars: The placement approach. In: Ehrig, H., Kreowski, HJ., Rozenberg, G. (eds) Graph Grammars and Their Application to Computer Science. Graph Grammars 1990. Lecture Notes in Computer Science, vol 532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017387

Download citation

  • DOI: https://doi.org/10.1007/BFb0017387

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54478-4

  • Online ISBN: 978-3-540-38395-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation