76 search results - page 4 / 16 » Random Edge Can Be Exponential on Abstract Cubes |
GLOBECOM
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— A cellular distributed antenna system with randomly located distributed antenna elements (AEs) and mobile users is considered. The AEs are connected to the base station...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Consider a scenario where one desires to simulate the execution of some graph algorithm on random input graphs of huge, perhaps even exponential size. Sampling and storing these h...
INFOCOM
2012
IEEE
12 years 12 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
ICOIN
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. In this paper we present the set of base algorithms for generating connected random graphs (RG). RG can be used for testing different algorithms on networks. The fast al...
CAEPIA
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We propose two different methods for generating random orthogonal polygons with a given number of vertices. One is a polynomial time algorithm and it is supported by a t...