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

DOI10.1007/978-3-030-78946-6_8MaRDI QIDQ6487181zbMATH OpenFDO

Authors Matthias Barkowsky, Holger Giese

Publication date 21 March 2022

Mathematics Subject Classification ID

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

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

Cites work

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

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)