COLOGNETWENTE
2010
14 years 1 months ago
2010
An interval total t coloring of a graph G is a total coloring of with colors 1, such that at least one vertex or edge of is colored by color − G 2, ,t… G , 1, 2, ,i i t= … ,...
COMBINATORICS
2006
14 years 3 months ago
2006
A proper edge colouring of a graph is neighbour-distinguishing if for all pairs of adjacent vertices v, w the set of colours appearing on the edges incident with v is not equal to...
APPROX
2006
Springer
14 years 6 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
ICALP
2009
Springer
15 years 3 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...