2354 search results - page 95 / 471 » Radio number for trees |
171
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
124
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...
140
click to vote
JGT
2007
15 years 6 months ago
2007
We introduce and study backbone colorings, a variation on classical vertex colorings: Given a graph G = (V, E) and a spanning subgraph H of G (the backbone of G), a backbone color...
157
click to vote
SECON
2007
IEEE
16 years 17 days ago
2007
IEEE
— In this paper we present empirical results from a study examining the effects of antenna diversity and placement on vehicle-to-vehicle link performance in vehicular ad hoc netw...
165
click to vote
EUROCAST
2007
Springer
15 years 10 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...