4171 search results - page 657 / 835 » Choice numbers of graphs |
184
click to vote
EUROPAR
2007
Springer
16 years 21 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...
174
click to vote
FSTTCS
2007
Springer
16 years 20 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...
175
click to vote
HPCC
2007
Springer
16 years 20 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...
181
click to vote
WDAG
2007
Springer
16 years 19 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...
168
click to vote
BROADNETS
2006
IEEE
16 years 17 days ago
2006
IEEE
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...