Skip to main content

PLEXUS: Tools for analyzing graph grammars

  • 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))

  • 193 Accesses

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

Access this chapter

Institutional subscriptions

References

  1. T. Lengauer and E. Wanke. Efficient analysis of graph properties on context-free graph languages. In T. Lepistö and A. Salomaa, editors, Proceedings of ICALP '88, volume 317 of Lecture Notes in Computer Science, pages 379–393. Springer-Verlag, Berlin/New York, 1988.

    Google Scholar 

  2. E. Wanke. Plexus: A system for implementing hierarchical graph algorithms. In R. Cori and M. Wirsing, editors, Proceedings of STACS '88, volume 294 of Lecture Notes in Computer Science, pages 401–402. Springer-Verlag, Berlin/New York, 1988. System demonstration.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

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

Wanke, E. (1991). PLEXUS: Tools for analyzing graph grammars. 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/BFb0017381

Download citation

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

  • 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