1857 search results - page 119 / 372 » Minimum Degree Orderings |
154
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— In the minimum energy broadcasting problem, each node can adjust its transmission power in order to minimize total energy consumption but still enable a message originated from...
147
click to vote
DM
2007
15 years 6 months ago
2007
Krishnamoorthy, Thulasiraman and Swamy [Minimum order graphs with specified diameter, connectivity and regularity, Networks 19 (1989) 25–46] showed that a δ-regular graph with...
196
click to vote
ENDM
2007
15 years 6 months ago
2007
d Abstract) Pascal Ochem∗, Alexandre Pinlou† LaBRI, Université Bordeaux 1, 351, Cours de la Libération, 33405 Talence Cedex, France March 16, 2007 A homomorphism from an ori...
171
click to vote
ENDM
2002
15 years 6 months ago
2002
A graph G homogeneously embeds in a graph H if for every vertex x of G and every vertex y of H there is an induced copy of G in H with x at y. The graph G uniformly embeds in H if...
177
click to vote
PPL
2000
15 years 6 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...