scientific article; zbMATH DE number 177433

MaRDI QIDQ4037307zbMATH OpenFDO

Authors

Publication date 18 May 1993

zbMATH Keywords

computational complexityforward chaininggraph grammarproduction systemsRETE-matching algorithmtime complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Efficient graph rewriting and its implementation
• Lana-Match algorithm: a parallel version of the Rete-Match algorithm
• scientific article; zbMATH DE number 4049117
• Match algorithms for generalized Rete networks
• scientific article; zbMATH DE number 177419

Cited in

(7)

• Lana-Match algorithm: a parallel version of the Rete-Match algorithm
• Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
• On the operationalization of graph queries with generalized discrimination networks
• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• scientific article; zbMATH DE number 4080959 (Why is no real title available?)
• scientific article; zbMATH DE number 177453 (Why is no real title available?)
• Bypass strong V-structures and find an isomorphic labelled subgraph in linear time

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4037307)