2079 search results - page 326 / 416 » Universality of random graphs |
142
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
Recent studies have shown that various models can explain the emergence of complex networks, such as scale-free and small-world networks. This paper presents a different model to...
144
click to vote
PET
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
131
click to vote
SRDS
2005
IEEE
15 years 9 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
134
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
121
click to vote
ESA
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signiï¬...