Constrained bipartite edge coloring with applications to wavelength routing
From MaRDI portal
Publication:4571980
DOI10.1007/3-540-63165-8_205zbMath1401.68251MaRDI QIDQ4571980
Erlebach, Thomas, Christos Kaklamanis, Pino Persiano, Klaus Jansen
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_205
90B18: Communication networks in operations research
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
On-line routing in all-optical networks, The complexity of path coloring and call scheduling, Edge coloring of bipartite graphs with constraints, On routing of wavebands for all-to-all communications in all-optical paths and cycles, Randomized path coloring on binary trees., Approximate constrained bipartite edge coloring, On-line routing in all-optical networks, A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree
Cites Work