1857 search results - page 84 / 372 » Minimum Degree Orderings |
126
click to vote
JGT
2008
15 years 6 months ago
2008
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
254
click to vote
CPC
2007
15 years 6 months ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
156
click to vote
CN
2004
15 years 6 months ago
2004
In this paper a novel handoff decision algorithm for the mobile subsystem of tactical communications systems is introduced. In this algorithm, handoff decision metrics are: receiv...
190
click to vote
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
In this paper, we study efficient data collection for wireless sensor networks. We present efficient distributed algorithms with approximately the minimum delay, or the minimum mes...
173
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...