2487 search results - page 420 / 498 » Partitions of Graphs into Trees |
PDPTA
2003
13 years 9 months ago
2003
In this paper, we study the coloring problem for the undirected binary de Bruijn interconnection network. The coloring scheme is simple and fast. We propose the coloring algorithm...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
: - In the first part of this paper we present the first steps towards providing low-risk and economically feasible network data transfer services. We introduce three types of data...
DISOPT
2010
13 years 8 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
GC
2008
Springer
13 years 8 months ago
2008
Springer
Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...
JCO
2008
13 years 8 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...