1425 search results - page 121 / 285 » Beyond Dependency Graphs |
110
Voted
GG
2008
Springer
15 years 3 months ago
2008
Springer
We present a new, high-level approach for the specification of model-to-model transformations based on declarative patterns. These are (atomic or composite) constraints on triple ...
121
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
137
Voted
TCS
2008
15 years 2 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
111
Voted
CORR
2004
Springer
15 years 2 months ago
2004
Springer
An optimization problem that naturally arises in the study of swarm robotics is the Freeze-Tag Problem (FTP) of how to awaken a set of "asleep" robots, by having an awak...
133
click to vote
JCO
2011
14 years 9 months ago
2011
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...