84 search results - page 5 / 17 » Total weight choosability of graphs |
SODA
2008
ACM
13 years 8 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
NETWORK
2010
13 years 2 months ago
2010
In this article we report on applications and extensions of weighted graph theory in the design and control of communication networks. We model the communication network as a weig...
ESA
1994
Springer
13 years 11 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...
STACS
2004
Springer
14 years 21 days ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
MOR
2007
13 years 6 months ago
2007
The objective of the demand matching problem is to obtain the subset M of edges which is feasible and where the sum of the profits of each of the edges is maximized. The set M is...