721 search results - page 129 / 145 » Bounds on the k-domination number of a graph |
110
click to vote
JUCS
2006
14 years 11 months ago
2006
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
107
click to vote
PODC
2009
ACM
16 years 9 days ago
2009
ACM
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
GD
2007
Springer
15 years 6 months ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
112
click to vote
CPM
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...