Paper Info
Title
Loose Graph Simulations.
Abstract
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 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.
Year
DOI
Venue
2017
10.1007/978-3-319-74730-9_9
Lecture Notes in Computer Science
DocType
Volume
ISSN
Conference
10748
0302-9743
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Alessio Mansutti1165.79
Marino Miculan250243.24
Marco Peressotti351.43