361 search results - page 24 / 73 » Relaxed Gabriel Graphs |
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— We study stochastic dynamic games with a large number of players, where players are coupled via their cost functions. A standard solution concept for stochastic games is Markov...
HEURISTICS
2002
13 years 7 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
JCT
2008
13 years 7 months ago
2008
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
AGTIVE
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we consider a large variety of solutions for the generation of Sierpinski triangles, one of the case studies for the AGTIVE graph transformation tool contest [15]. A...
AGTIVE
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Applying refactoring in a model-driven software engineering context raises many new challenges that need to be addressed. In this paper, we consider model-driven software...