13214 search results - page 2359 / 2643 » Pseudorandomness for network algorithms |
187
click to vote
RSA
2008
15 years 6 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
220
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Non-negative tensor factorization (NTF) is a relatively new technique that has been successfully used to extract significant characteristics from polyadic data, such as data in s...
173
click to vote
COMCOM
2010
15 years 5 months ago
2010
Understanding the relationship between queueing delays and link utilization for general traffic conditions is an important open problem in networking research. Difficulties in und...
157
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
171
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract—When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy kn...