TC
2008
14 years 9 months ago
2008
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
WEA
2007
Springer
15 years 3 months ago
2007
Springer
Given a bipartite graph G = (L0, L1, E) and a fixed ordering of the nodes in L0, the problem of finding an ordering of the nodes in L1 that minimizes the number of crossings has ...
103
click to vote
MOBIHOC
2002
ACM
15 years 9 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...