Name
Abstract | ||
|---|---|---|
Abstract. Despite the large variety of existing graph transformation tools, the implementation of their pattern matching,engine typically follows the same principle. First a matching,occurrence of the left-hand side of the graph transformation rule is searched by some graph pattern matching algorithm. Then potential negative application conditions are checked that might eliminate the previous occurrence. However, when a new transformation step is started, all the information on previous matchings is lost, and the complex graph pattern matching phase is restarted from scratch each time. In the paper, we present the foundational data structures and initial experiments for an incremental graph pattern matching,engine which keeps track of existing matchings in an incremental way to reduce the execution time of graph pattern matching. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.14279/tuj.eceasst.4.12.4 | ECEASST |
Keywords | Field | DocType |
data structure,pattern matching | Strength of a graph,Computer science,Bipartite graph,Theoretical computer science,Null graph,Graph rewriting,3-dimensional matching,Pattern matching,Blossom algorithm,Complement graph | Journal |
Volume | Citations | PageRank |
4 | 14 | 1.05 |
References | Authors | |
10 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gergely Varró | 1 | 403 | 36.67 |
| Dániel Varró | 2 | 1682 | 118.10 |
| Andy Schürr | 3 | 2195 | 230.25 |