scientific article; zbMATH DE number 177433

zbMATH Open0765.68081MaRDI QIDQ4037307FDOQ4037307

Authors:

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

computational complexitytime complexityproduction systemsgraph grammarforward chainingRETE-matching algorithm

Mathematics Subject Classification ID

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

Cited In (6)

• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• Bypass strong V-structures and find an isomorphic labelled subgraph in linear time
• Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
• Title not available (Why is that?)
• On the operationalization of graph queries with generalized discrimination networks
• Title not available (Why is that?)

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)