36 search results - page 2 / 8 » Time Efficient Radio Broadcasting in Planar Graphs |
SIROCCO
2004
13 years 7 months ago
2004
Abstract. We study asynchronous packet radio networks in which transmissions among nodes may be delayed. We consider the task of broadcasting a message generated by the source node...
WICON
2008
13 years 7 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
STOC
1990
ACM
13 years 9 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...
MONET
2006
13 years 5 months ago
2006
The radio frequency spectrum is a naturally limited resource of extraordinary value, as the key to the provision of important communication and information services. Traditionally,...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...