376 search results - page 69 / 76 » Completely connected clustered graphs |
JCT
2010
13 years 6 months ago
2010
An Avoider-Enforcer game is played by two players, called Avoider and Enforcer, on a hypergraph F ⊆ 2X . The players claim previously unoccupied elements of the board X in turns...
CLEIEJ
2010
13 years 5 months ago
2010
A 3D circuit is the stacking of regular 2D circuits. The advances on the fabrication and packaging technologies allowed interconnecting stacked 2D circuits by using 3D vias. Howeve...
CPC
2010
13 years 5 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
SIGCOMM
2004
ACM
14 years 1 months ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
DNA
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...