An efficient implementation of graph grammars based on the RETE matching algorithm (Q4037307)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 177433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient implementation of graph grammars based on the RETE matching algorithm |
scientific article; zbMATH DE number 177433 |
Statements
18 May 1993
0 references
RETE-matching algorithm
0 references
computational complexity
0 references
graph grammar
0 references
forward chaining
0 references
production systems
0 references
time complexity
0 references
0.749842643737793
0 references
0.7417539358139038
0 references
0.7155939340591431
0 references
0.7155939340591431
0 references
An efficient implementation of graph grammars based on the RETE matching algorithm (English)
0 references
