505 search results - page 30 / 101 » On A Graph Formalism for Ordered Edges |
SIROCCO
2007
14 years 11 months ago
2007
Abstract. A large group of autonomous, mobile entities e.g. robots initially placed at some arbitrary node of the graph has to jointly visit all nodes (not necessarily all edges) a...
FUIN
2006
14 years 9 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
JGT
2008
14 years 9 months ago
2008
Let G be a simple graph of order n with no isolated vertices and no isolated edges. For a positive integer w, an assignment f on G is a function f : E(G) {1, 2, . . . , w}. For a ...
114
click to vote
WG
2010
Springer
14 years 8 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
103
Voted
FLAIRS
2008
14 years 12 months ago
2008
Storyboards are commonly known as rows of pictures, which exemplarily sketch scenes in performing arts. The rows specify the sequence of scenes. The scenes themselves are illustra...