721 search results - page 27 / 145 » Graphs with Large Obstacle Numbers |
CORR
2007
Springer
13 years 9 months ago
2007
Springer
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring...
DM
2007
13 years 9 months ago
2007
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
CCCG
2008
13 years 11 months ago
2008
We consider planning optimal collision-free motions of two polygonal robots under translation. Each robot has a reference point that must lie on a given graph, called a roadmap, w...
IM
2007
13 years 9 months ago
2007
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
IROS
2007
IEEE
14 years 3 months ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...