Wavelength assignment in multifiber star networks

DOI10.1002/net.20345zbMath1208.90175OpenAlexW4238082519MaRDI QIDQ3057165

Qian-Ping Gu, Zhengbing Bian

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20345

zbMATH Keywords

approximation algorithmsrouting and wavelength assignmentcall controlstar networkspath multicoloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Path multicoloring in spider graphs with even color multiplicity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Geometric algorithms and combinatorial optimization
• Routing and path multicoloring
• On the \(k\)-coloring of intervals
• Path multicoloring with fewer colors in spiders and caterpillars
• Path problems in generalized stars, complete graphs, and brick wall graphs
• Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
• Efficient routing in all-optical networks
• On the f-coloring of multigraphs
• Automata, Languages and Programming
• Graph-Theoretic Concepts in Computer Science
• The complexity of path coloring and call scheduling