1729 search results - page 200 / 346 » Bound Graph Polysemy |
164
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the problem of shortest-path geographic routing in a static sensor network. Existing algorithms often make routing decisions based on node information in local neighbo...
141
click to vote
MFCS
2009
Springer
16 years 28 days ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
206
click to vote
AAIM
2007
Springer
16 years 18 days ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
150
click to vote
WDAG
2007
Springer
16 years 15 days ago
2007
Springer
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
160
click to vote
UC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...