Hybrid search plan generation for generalized graph pattern matching

DOI10.1016/J.JLAMP.2020.100563zbMath1451.68198OpenAlexW2955934663MaRDI QIDQ780064

Holger Giese, Matthias Barkowsky

Publication date: 14 July 2020

Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlamp.2020.100563

zbMATH Keywords

graph pattern matchingsearch plan generation

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Preface to the special issue on the 12th international conference on graph transformation

Uses Software

• Henshin
• Unnamed Item

Cites Work

• Fundamentals of algebraic graph transformation
• Incremental graph pattern matching
• On the Operationalization of Graph Queries with Generalized Discrimination Networks
• GrGen: A Fast SPO-Based Graph Rewriting Tool
• An Algorithm for Subgraph Isomorphism

This page was built for publication: Hybrid search plan generation for generalized graph pattern matching