723 search results - page 71 / 145 » On the hyperbolicity constant in graphs |
143
click to vote
SIGECOM
2006
ACM
16 years 4 days ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
151
click to vote
UC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We study computational complexity of counting the fixed point configurations (FPs) in certain classes of graph automata viewed as discrete dynamical systems. We prove t...
163
click to vote
WG
1993
Springer
15 years 10 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
213
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
Large scale real-world network data such as social and information networks are ubiquitous. The study of such social and information networks seeks to find patterns and explain th...