66 search results - page 10 / 14 » Graph Coloring using Peer-to-Peer Networks |
ADHOCNOW
2004
Springer
14 years 1 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
RAID
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Network worms are malicious programs that spread automatically across networks by exploiting vulnerabilities that affect a large number of hosts. Because of the speed at...
BMCBI
2010
13 years 2 months ago
2010
Background: Linking high-throughput experimental data with biological networks is a key step for understanding complex biological systems. Currently, visualization tools for large...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
SIROCCO
2007
13 years 9 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...