### Resumé

Originalsprog | Engelsk |
---|---|

Status | Udgivet - 23. maj 2017 |

### Fingeraftryk

### Citer dette

*Loose Graph Simulations*.

}

**Loose Graph Simulations.** / Mansutti, Alessio; Miculan, Marino; Peressotti, Marco.

Publikation: Working paper › Forskning

TY - UNPB

T1 - Loose Graph Simulations

AU - Mansutti, Alessio

AU - Miculan, Marino

AU - Peressotti, Marco

PY - 2017/5/23

Y1 - 2017/5/23

N2 - We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly also problems which are "mixed" instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide a formal translation of SGI, RLPM, and GS into LGSs, and we give the representation of a problem which extends both SGI and RLPM. Finally, we identify a subclass of the LGS problem that is polynomial.

AB - We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly also problems which are "mixed" instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide a formal translation of SGI, RLPM, and GS into LGSs, and we give the representation of a problem which extends both SGI and RLPM. Finally, we identify a subclass of the LGS problem that is polynomial.

M3 - Working paper

BT - Loose Graph Simulations

ER -