Sciweavers

1425 search results - page 121 / 285
» Beyond Dependency Graphs
Sort
View
GG
2008
Springer
13 years 9 months ago
Pattern-Based Model-to-Model Transformation
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 ...
Juan de Lara, Esther Guerra
CORR
2008
Springer
115views Education» more  CORR 2008»
13 years 8 months ago
Positive circuits and maximal number of fixed points in discrete dynamical systems
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...
Adrien Richard
TCS
2008
13 years 8 months ago
Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree
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...
Anne Berry, Elias Dahlhaus, Pinar Heggernes, Genev...
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 8 months ago
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots
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...
Esther M. Arkin, Michael A. Bender, Sándor ...
JCO
2011
113views more  JCO 2011»
13 years 3 months ago
Hardness and algorithms for rainbow connection
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...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...