376 search results - page 15 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the input is given as a sequence of items passing only once or a few times, and we ar...
CDC
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper is concerned with studying how the minimum power loss in a power system is related to its network topology. The existing algorithms in the literature all exploit nonline...
COLT
2008
Springer
13 years 9 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
ESA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
ESORICS
2004
Springer
14 years 1 months ago
2004
Springer
We evaluate the anonymity provided by two popular email mix implementations, Mixmaster and Reliable, and compare their effectiveness through the use of simulations which model th...