Bipartite Edge Coloring in $O(\Delta m)$ Time
SIAM Journal on Computing
Improved access to optical bandwidth in trees
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Efficient Wavelength Routing on Directed Fiber Trees
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
Efficient access to optical bandwidth
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Graphs and Hypergraphs
Wide-Sense Nonblocking WDM Cross-Connects
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximate constrained bipartite edge coloring
Discrete Applied Mathematics
A graph coloring based service discovery in ad hoc networks
Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
A strict strong coloring of trees
Information Processing Letters
Approximation algorithms for path coloring in trees
Efficient Approximation and Online Algorithms
A Generalized Graph Strict Strong Coloring Algorithm
International Journal of Applied Metaheuristic Computing
| Hi-index | 5.23 |
A classical result from graph theory states that the edges of an l-regular bipartite graph can be colored using exactly l colors so that edges that share an endpoint are assigned different colors. In this paper, we study two constrained versions of the bipartite edge coloring problem. Some of the edges adjacent to a specific pair of opposite vertices of an l-regular bipartite graph are already colored with S colors that appear only on one edge (single colors) and D colors that appear on two edges (double colors). We show that the rest of the edges can be colored using at most max{min{l+D,3l/2},l+(S+D)/2} total colors. We also show that this bound is tight by constructing instances in which max{min{l+D,3l/2},l+(S+D)/2} colors are indeed necessary. - Some of the edges of an l-regular bipartite graph are already colored with S colors that appear only on one edge. We show that the rest of the edges can be colored using at most max{l+S/2,S} total colors. We also show that this bound is tight by constructing instances in which max{l+S/2,S} total colors are necessary.