1550 search results - page 11 / 310 » Benchmarking for Graph Transformation |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We present k-Flipper, a graph transformation algorithm that transforms regular undirected graphs. Given a path of k +2 edges it interchanges the end vertices of the path. By defin...
ECEASST
2008
13 years 7 months ago
2008
FASE
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Collaboration diagrams as described in the official UML documents specify patterns of system structure and interaction. In this paper, we propose their use for specifying...
CASES
2009
ACM
14 years 2 months ago
2009
ACM
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
ENTCS
2008
13 years 7 months ago
2008
Graph transformation units are an approach-independent concept for programming by applying rules and imported transformation units to graphs, starting in an initial and ending in ...