Skip to main content
SpringerLink
Log in

Neighborhood-Preserving Node Replacements

  • Conference paper
Theory and Application of Graph Transformations (TAGT 1998)

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

Abstract

We introduce a general normal form for eNCE graph grammars and use it for a characterization of the class of all neighborhood-preserving eNCE graph languages in terms of a weak notion of order-independency.

The work of the first author was supported by the German Research Association (DFG) grant BR 835/7-1

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brandenburg, F.-J.: On partially ordered graph grammars. In: Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.) Graph Grammars 1986. LNCS, vol. 291, pp. 99–111. Springer, Heidelberg (1987)

    Google Scholar 

  2. Brandenburg, F.-J.: The equivalence of boundary and confluent graph grammars on graph languages of bounded degree. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 312–322. Springer, Berlin (1991)

    Google Scholar 

  3. Claus, V., Ehrig, H., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol. 73. Springer, Berlin (1979)

    Google Scholar 

  4. Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. System Sci. 46, 218–270 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Cuny, J., Ehrig, H., Engels, G., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol. 1073. Springer, Berlin (1994)

    Google Scholar 

  6. Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol. 532. Springer, Berlin (1991)

    Google Scholar 

  7. Ehrig, H., Nagl, M., Rosenfeld, A., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol. 291. Springer, Berlin (1987)

    Google Scholar 

  8. Ehrig, H., Nagl, M., Rozenberg, G. (eds.): Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol. 153. Springer, Berlin (1983)

    Google Scholar 

  9. Engelfriet, J., Leih, G., Welzl, E.: Boundary graph grammars with dynamic edge relabeling. J. Comput. System Sci. 40, 307–345 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Engelfriet, J., Rozenberg, G.: A comparison of boundary graph grammars and context-free hypergraph grammars. Inform. Comput. 84, 163–206 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  11. Engelfriet, J., Rozenberg, G.: Node replacement graph grammars. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations, ch. 1, vol. 1, pp. 1–94. World Scientific Publishing Co. Pte. Ltd., Singapore (1997)

    Chapter  Google Scholar 

  12. Habel, A.: Hyperedge Replacement: Grammars and Languages. LNCS, vol. 643. Springer, Berlin (1992)

    MATH  Google Scholar 

  13. Himsolt, M.: Graphed: An interactive tool for developing graph grammars. In: Proc. of Graph Grammars and their Application to Computer Science. LNCS, vol. 532, pp. 61–65 (1991)

    Google Scholar 

  14. Janssens, D., Rozenberg, G.: Restrictions, extensions, and variations of NLC grammars. Inform. Sci. 20, 217–244 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  15. Janssens, D., Rozenberg, G.: Decision problems for node label controlled graph grammars. J. Comput. System Sci. 22, 144–177 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  16. Jeffs, J.: Order independent NCE grammars recognized in polynomial time. Inform. Process. Lett. 39, 161–164 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  17. Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Informat. 27, 399–421 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  18. Rozenberg, G., Welzl, E.: Boundary NLC graph grammars - basic definitions, normal forms and complexity. Inform. Comput. 69, 136–167 (1986)

    MATH  MathSciNet  Google Scholar 

  19. Skodinis, K., Wanke, E.: Neighborhood-preserving confluent node replacement. Manuscript (1995)

    Google Scholar 

  20. Proceedings of IEEE Symposium on Visual Languages. IEEE, Isle of Capri, Italy (1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Passau, D-94032, Passau, Germany

    Konstantin Skodinis

  2. University of Düsseldorf, D-40225, Düsseldorf, Germany

    Egon Wanke

Authors
  1. Konstantin Skodinis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Egon Wanke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Technische Universität Berlin, Germany

    Hartmut Ehrig

  2. University of Paderborn, Warburger Straße 100, 33098, Paderborn, Germany

    Gregor Engels

  3. Department of Computer Science, University of Bremen, P.O. Box 33 04 40, 28334, Bremen, Germany

    Hans-Jörg Kreowski

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skodinis, K., Wanke, E. (2000). Neighborhood-Preserving Node Replacements. In: Ehrig, H., Engels, G., Kreowski, HJ., Rozenberg, G. (eds) Theory and Application of Graph Transformations. TAGT 1998. Lecture Notes in Computer Science, vol 1764. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46464-8_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-46464-8_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67203-6

  • Online ISBN: 978-3-540-46464-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation