1274 search results - page 50 / 255 » Graph lambda theories |
DM
2010
13 years 9 months ago
2010
For a graph G, a signed domination function of G is a two-colouring of the vertices of G with colours +1 and
DM
2008
13 years 9 months ago
2008
Ore presented a degree condition involving every pair of nonadjacent vertices for a graph to be hamiltonian. Fan (J. Combin. Theory Ser. B 37 (1984) 221
ICRA
2010
IEEE
13 years 7 months ago
2010
IEEE
— Using graph theory, this paper investigates how a group of robots, endowed with local positioning (range and bearing from other robots), can be engaged in a leaderfollowing mis...
MODELS
2007
Springer
14 years 3 months ago
2007
Springer
The integration of different models, such as scenarios, is an important component of the requirements engineer’s work. If manually performed, the integration operation is error-...
IJCAI
2003
13 years 10 months ago
2003
Automated verification is one of the most success ful applications of automated reasoning in com puter science. In automated verification one uses algorithmic techniques to es...