75 search results - page 12 / 15 » Randomly Coloring Constant Degree Graphs |
WIOPT
2006
IEEE
15 years 3 months ago
2006
IEEE
— This paper develops a novel color-based broadcast scheme for wireless ad hoc networks where each forwarding of the broadcast message is assigned a color from a given pool of co...
STOC
1995
ACM
15 years 28 days ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
108
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed ...
103
click to vote
FSTTCS
2004
Springer
15 years 2 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...
116
click to vote
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...