Himesis : a hierarchical subgraph matching kernel for model driven development
Himesis is a complete yet minimal kernel for meta-modelling and model transformation, which consists of a specification of hierarchical graphs and in a highly efficient matching algorithm. Himesis graphs encode the essence of models: nodes, edges, containment, attributes, names and labels. There is...
Main Author: | Provost, Marc, 1981- |
---|---|
Format: | Others |
Language: | en |
Published: |
McGill University
2005
|
Subjects: | |
Online Access: | http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=98772 |
Similar Items
-
A Context-Driven Subgraph Model for Literature-Based Discovery
by: Cameron, Delroy Huborn
Published: (2014) -
Verifiable Subgraph Matching With Cryptographic Accumulators in Cloud Computing
by: Yixiao Zhu, et al.
Published: (2019-01-01) -
An Efficient System for Subgraph Discovery
by: Joshi, Aparna
Published: (2019) -
Learning with Degree-Based Subgraph Estimation
by: Huang, Bert
Published: (2011) -
Approximating the maximum acyclic subgraph
by: Newman, Alantha
Published: (2014)