10 search results - page 1 / 2 » Fractional Path Coloring in Bounded Degree Trees with Applic... |
ALGORITHMICA
2010
13 years 5 months ago
2010
PCI
2005
Springer
13 years 10 months ago
2005
Springer
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring probl...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
AINA
2010
IEEE
13 years 10 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
ESA
1994
Springer
13 years 9 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...