376 search results - page 40 / 76 » Betweenness Centrality : Algorithms and Lower Bounds |
ALGORITHMICA
2010
13 years 7 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
SOFSEM
1997
Springer
13 years 12 months ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
ESA
2006
Springer
13 years 11 months ago
2006
Springer
A sensor network consists of sensing devices which may exchange data through wireless communication. A particular feature of sensor networks is that they are highly energy constrai...
SODA
2012
ACM
11 years 10 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...