Blar i Department of Informatics på emneord "Matching"
Viser treff 1-2 av 2
-
A Comparison of Vertex and Edge Partitioning Approaches for Parallel Maximal Matching
(Master thesis, 2013-12-09)This thesis will compare two ways of distributing data for parallel graph algorithms: vertex and edge partitioning, using a distributed memory system. Previous studies on the parallelization of graphs has often been focused ... -
Towards a multilevel model transformation engine
(Master thesis, 2017)Domain specific modelling languages (DSML) are usually defined through fixed level meta modelling tools such as EMF. While this is sufficient for defining languages that has no overlap with other languages, the approach ...