3757 search results - page 603 / 752 » The overlap number of a graph |
161
click to vote
COCO
2007
Springer
16 years 18 days ago
2007
Springer
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the degree (which is polylogarithmic in the number of ...
182
click to vote
EUROPAR
2007
Springer
16 years 17 days ago
2007
Springer
We study the connectivity properties of a family of random graphs which closely model the Bluetooth’s device discovery process, where each device tries to connect to other device...
173
click to vote
FSTTCS
2007
Springer
16 years 17 days ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
173
click to vote
HPCC
2007
Springer
16 years 17 days ago
2007
Springer
The OTIS-Network (also referred to as two-level swapped network) is composed of n clones of an n-node original network constituting its clusters. It has received much attention due...
178
click to vote
WDAG
2007
Springer
16 years 15 days ago
2007
Springer
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...