4865 search results - page 82 / 973 » The Complexity of Graph Connectivity |
107
Voted
DAC
2006
ACM
16 years 3 months ago
2006
ACM
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
107
Voted
JCT
2011
14 years 9 months ago
2011
Given a simple graph G, the graph associahedron KG is a simple polytope whose face poset is based on the connected subgraphs of G. This paper defines and constructs graph associah...
155
Voted
FSTTCS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
118
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
143
Voted
DIALM
2003
ACM
15 years 8 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...