DeepAI AI Chat

Accretive Computation of Global Transformations of Graphs

03/17/2021

∙

by Alexandre Fernandez, et al.

∙

∙

The framework of global transformations aims at describing synchronous rewriting systems on a given data structure. In this work we focus on the data structure of graphs. Global transformations of graphs are defined and a local criterion is given for a rule system to extend to a graph global transformation. Finally we present an algorithm, with its correction, which computes online the global transformation of a finite graph in an accretive manner.

Alexandre Fernandez
2 publications
Luidnel Maignan
3 publications
Antoine Spicher
2 publications

page 1

page 2

page 3

page 4

∙ 03/27/2013

Computational Aspects of the Mobius Transform

In this paper we associate with every (directed) graph G a transformatio...

0 Robert Kennes, et al. ∙

∙ 07/03/2019

Linear transformations between colorings in chordal graphs

Let k and d be such that k > d+2. Consider two k-colorings of a d-degene...

0 Nicolas Bousquet, et al. ∙

∙ 03/03/2010

Automatically Discovering Hidden Transformation Chaining Constraints

Model transformations operate on models conforming to precisely defined ...

0 Raphael Chenouard, et al. ∙

∙ 12/03/2020

Reversibility and Composition of Rewriting in Hierarchies

In this paper, we study how graph transformations based on sesqui-pushou...

0 Russ Harmer, et al. ∙

∙ 07/23/2020

Sign-curing local Hamiltonians: termwise versus global stoquasticity and the use of Clifford transformations

We elucidate the distinction between global and termwise stoquasticity f...

0 Marios Ioannou, et al. ∙

∙ 06/25/2020

Multilevel Typed Graph Transformations

Multilevel modeling extends traditional modeling techniques with a poten...

0 Uwe Wolter, et al. ∙

∙ 01/12/2022

Efficient Modular Graph Transformation Rule Application

Graph transformation formalisms have proven to be suitable tools for the...

0 Jakob L. Andersen, et al. ∙