83 search results - page 3 / 17 » Solving Coverage Problems with Embedded Graph Grammars |
GD
2006
Springer
13 years 10 months ago
2006
Springer
Graph drawing research traditionally focuses on producing geometric embeddings of graphs satisfying various aesthetic constraints. However additional work must still be done to dra...
SENSYS
2003
ACM
14 years 7 days ago
2003
ACM
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
TASE
2010
IEEE
13 years 1 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
ESA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We prove that for every graph H, there exists a polynomial-time algorithm deciding if a planar graph can be contracted to H. We introduce contractions and topological min...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...