1986 search results - page 150 / 398 » Path Separability of Graphs |
AROBOTS
2006
13 years 10 months ago
2006
All mobile bases suffer from localization errors. Previous approaches to accommodate for localization errors either use external sensors such as lasers or sonars, or use internal s...
APSCC
2009
IEEE
14 years 4 months ago
2009
IEEE
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access righ...
ISAAC
2003
Springer
14 years 3 months ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
DLT
2008
13 years 11 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
GEM
2007
13 years 11 months ago
2007
We present a method for searching for achordal open paths (snakes) in n-dimensional hypercube graphs (the box). Our technique first obtains a set of exemplary snakes using an evo...