Patch Graph Rewriting

03/13/2020
by   Roy Overbeek, et al.
0

The basic principle of graph rewriting is the stepwise replacement of subgraphs inside a host graph. A challenge in such replacement steps is the treatment of the patch graph, consisting of those edges of the host graph that touch the subgraph, but are not part of it. We introduce the patch graph rewriting framework, a visual graph rewriting language with precise formal semantics. The language has rich expressive power in two ways. Firstly, rules can flexibly constrain the permitted shapes of patches touching matching subgraphs. Secondly, rules can freely transform patches. While the framework is designed to be easy to understand, it subsumes many approaches to graph rewriting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2021

Multipatch ZIKV Model and Simulations

In this article we compare two multi-patch models for the spread of Zika...
research
04/14/2023

Combining Stochastic Explainers and Subgraph Neural Networks can Increase Expressivity and Interpretability

Subgraph-enhanced graph neural networks (SGNN) can increase the expressi...
research
08/12/2020

Deterministic Replacement Path Covering

In this article, we provide a unified and simplified approach to derando...
research
03/29/2023

On Hypergraph Supports

Let ℋ=(X,ℰ) be a hypergraph. A support is a graph Q on X such that for e...
research
04/17/2018

Temporal Coherent and Graph Optimized Manifold Ranking for Visual Tracking

Recently, weighted patch representation has been widely studied for alle...
research
08/24/2021

Supernodes

In this paper, we present two new concepts related to subgraph counting ...

Please sign up or login with your details

Forgot password? Click here to reset