3268 search results - page 525 / 654 » The hub number of a graph |
154
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
213
click to vote
INFOCOM
2012
IEEE
13 years 8 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
187
click to vote
PODC
2009
ACM
16 years 7 months 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...
183
click to vote
FSTTCS
2009
Springer
16 years 28 days ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
154
click to vote
GC
2007
Springer
15 years 6 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...