106 search results - page 3 / 22 » Colored Trees in Edge-Colored Graphs |
ESA
2008
Springer
13 years 7 months ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
DAM
2002
13 years 5 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
FSTTCS
2000
Springer
13 years 9 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
DM
2000
13 years 5 months ago
2000
A variation of preemptive open shop scheduling corresponds to
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
— This paper presents a transmission scheduling scheme in sensor networks. Each node is assigned a list of time slots to use for unicast and broadcast communication. The algorith...