4865 search results - page 670 / 973 » The Complexity of Graph Connectivity |
156
Voted
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
Long-distance multi-hop wireless networks have been used in recent years to provide connectivity to rural areas. The salient features of such networks include TDMA channel access, ...
163
Voted
SOCIALCOM
2010
15 years 2 months ago
2010
Abstract--This paper is about how groups solve global coordination problems such as the distributed graph coloring problem. We focused on scenarios in which agents are not able to ...
163
click to vote
CLEIEJ
2010
15 years 2 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...
169
click to vote
CPC
2010
15 years 2 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)...
180
click to vote
FGCS
2011
15 years 7 hour ago
2011
A description of a data item’s provenance can be provided in different forms, and which form is best depends on the intended use of that description. Because of this, differen...