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

Full work available at URL https://doi.org/10.1007/978-3-030-78946-6_8

Mathematics Subject Classification ID

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

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
• Graph minors. III. Planar tree-width
• GrGen: A Fast SPO-Based Graph Rewriting Tool
• On the complexity of H-coloring

Cited in

(6)

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

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)