1447 search results - page 132 / 290 » Graphs and Path Equilibria |
165
click to vote
APSCC
2009
IEEE
15 years 11 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...
123
click to vote
ISAAC
2003
Springer
15 years 9 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...
135
click to vote
DLT
2008
15 years 5 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...
140
click to vote
GEM
2007
15 years 5 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...
161
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
—Greedy embedding is a graph embedding that makes the simple greedy packet forwarding scheme successful for every source-destination pair. It is desirable that graph embeddings a...