The contractum in algebraic graph rewriting
From MaRDI portal
Publication:4645265
DOI10.1007/3-540-61228-9_76zbMATH Open1412.68097OpenAlexW1865568737MaRDI QIDQ4645265FDOQ4645265
Authors: Richard Banach 
Publication date: 10 January 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61228-9_76
Recommendations
- scientific article; zbMATH DE number 517053
- On graph rewritings
- scientific article; zbMATH DE number 3878382
- Theoretical Computer Science
- Contractors and connectors of graph algebras
- Algebraic graph rewriting with controlled embedding
- scientific article; zbMATH DE number 4049097
- A Rewriting Approach to Graph Invariants
- Graph expressions and graph rewritings
- scientific article; zbMATH DE number 234035
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Term graph rewriting and garbage collection using opfibrations
- Title not available (Why is that?)
- Pushout-Properties: An analysis of gluing constructions for graphs
- Parallelism and concurrency in high-level replacement systems
- Title not available (Why is that?)
- Canonical derivations for high-level replacement systems
- Locating the contractum in the double pushout approach
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: The contractum in algebraic graph rewriting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645265)
