1054 search results - page 48 / 211 » Capacitated Domination Problem |
151
Voted
MOBIHOC
2002
ACM
16 years 2 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...
116
click to vote
MST
2006
15 years 2 months ago
2006
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...
113
click to vote
ISCAS
2005
IEEE
15 years 8 months ago
2005
IEEE
Inductance effects of on-chip interconnects have become more and more significant in today’s high-speed digital circuits, especially for global interconnects such as signal buse...
129
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
ICEC
1994
15 years 3 months ago
1994
homologous alleles seemingly compete prior to manifestation in the observed phenotype, will be referred to as sub-phenotype interaction.A method is proposed for implementing diploi...