1952 search results - page 282 / 391 » Complete partitions of graphs |
198
click to vote
IPPS
2000
IEEE
15 years 10 months ago
2000
IEEE
Metacomputing infrastructures couple multiple clusters (or MPPs) via wide-area networks. A major problem in programming parallel applications for such platforms is their hierarchi...
205
click to vote
DAGSTUHL
2000
15 years 7 months ago
2000
This paper introduces our one-armed stationary humanoid robot GripSee together with research projects carried out on this platform. The major goal is to have it analyze a table sce...
167
click to vote
SIROCCO
2000
15 years 7 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
187
click to vote
FUIN
2008
15 years 6 months ago
2008
We study runtime distributions of subsumption testing. On graph data randomly sampled from two different generative models we observe a gradual growth of the tails of the distribut...
125
click to vote
CPC
2006
15 years 6 months ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...