Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Efficient graph rewriting and its implementation

From MaRDI portal
Publication:1894781
Jump to:navigation, search

zbMath1154.68435MaRDI QIDQ1894781

Heiko Dörr

Publication date: 24 July 1995

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)



Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of programming languages (68N15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Grammars and rewriting systems (68Q42)


Related Items (6)

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants ⋮ Unnamed Item ⋮ Programmed graph transformations and graph transformation units in GRACE ⋮ The Edge of Graph Transformation — Graphs for Behavioural Specification ⋮ Lessons Learned from Building a Graph Transformation System ⋮ Finding a Forest in a Tree


Uses Software

  • PROGRES
  • Miranda





This page was built for publication: Efficient graph rewriting and its implementation

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1894781&oldid=14300061"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:17.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki