Host-graph-sensitive RETE nets for incremental graph pattern matching

DOI10.1007/978-3-030-78946-6_8zbMATH Open1512.68063MaRDI QIDQ6487181FDOQ6487181

Authors: Matthias Barkowsky, Holger Giese 

Publication date: 21 March 2022

Recommendations

• Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
• Pattern graph change oriented incremental graph pattern matching
• Incremental graph pattern matching
• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• Rete network slicing for model queries

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Grammars and rewriting systems (68Q42)

Cites Work

• GrGen: A Fast SPO-Based Graph Rewriting Tool
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• On the complexity of H-coloring
• Graph minors. III. Planar tree-width
• Fundamentals of algebraic graph transformation

Cited In (6)

• A Benchmark Evaluation of Incremental Pattern Matching in Graph Transformation
• Rete network slicing for model queries
• Pattern graph change oriented incremental graph pattern matching
• Hybrid search plan generation for generalized graph pattern matching
• Host-graph-sensitive RETE nets for incremental graph pattern matching with nested graph conditions
• From pattern invocation networks to rule preconditions

This page was built for publication: Host-graph-sensitive RETE nets for incremental graph pattern matching

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