[henshin-user] Complexity of the method InterpreterUtil.findAllMatches

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index] [List Home]

[henshin-user] Complexity of the method InterpreterUtil.findAllMatches

From: Svetlana Arifulina <svetlana.arifulina@xxxxxxxxxxxxxxxx>
Date: Sat, 03 Oct 2015 14:59:19 +0200
Delivered-to: henshin-user@xxxxxxxxxxx
List-archive: <https://dev.eclipse.org/mailman/private/henshin-user>
List-help: <mailto:henshin-user-request@eclipse.org?subject=help>
List-subscribe: <https://dev.eclipse.org/mailman/listinfo/henshin-user>, <mailto:henshin-user-request@eclipse.org?subject=subscribe>
List-unsubscribe: <https://dev.eclipse.org/mailman/options/henshin-user>, <mailto:henshin-user-request@eclipse.org?subject=unsubscribe>
User-agent: Internet Messaging Program (IMP) H5 (6.2.2)


Hello Henshin developers and Henshin users,

my name is Svetlana and I use the graph matching of Henshin in my PhDThesis. For my research, I would like to know if there are any paperspublished, in which the complexity of the method findAllMatches ofInterpreterUtil is estimated?


Thank you in advance.

Best regards

Svetlana Arifulina

Follow-Ups:
- Re: [henshin-user] Complexity of the method InterpreterUtil.findAllMatches
  - From: Christian Krause

Prev by Date: Re: [henshin-user] UML state machines and dangling edges?
Next by Date: Re: [henshin-user] Complexity of the method InterpreterUtil.findAllMatches
Previous by thread: [henshin-user] UML state machines and dangling edges?
Next by thread: Re: [henshin-user] Complexity of the method InterpreterUtil.findAllMatches
Index(es):
- Date
- Thread

Breadcrumbs