218 search results - page 5 / 44 » Connectivity graphs as models of local interactions |
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
SNPD
2007
14 years 11 months ago
2007
Source and destination location privacy is a challenging and important problem in sensor networks. Nevertheless, privacy preserving communication in sensor networks is still a vir...
129
click to vote
ACRI
2010
Springer
14 years 6 months ago
2010
Springer
This paper investigates the behaviors and the properties of a "Give and Take" cellular automaton on a graph. Using an economical metaphor, this model implements the excha...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...