1749 search results - page 201 / 350 » Conditional colorings of graphs |
188
click to vote
ENDM
2002
15 years 6 months ago
2002
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
213
click to vote
LION
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Protein function prediction represents a fundamental challenge in bioinformatics. The increasing availability of proteomics network data has enabled the development of se...
130
click to vote
ICTAI
2008
IEEE
16 years 1 months ago
2008
IEEE
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
181
click to vote
GD
2004
Springer
16 years 2 days ago
2004
Springer
Sensor network applications frequently require that the sensors know their physical locations in some global coordinate system. This is usually achieved by equipping each sensor w...
173
click to vote
COCOON
2003
Springer
15 years 12 months ago
2003
Springer
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...