All-to-all wavelength-routing in all-optical compound networks
From MaRDI portal
Publication:5937949
DOI10.1016/S0012-365X(00)00289-2zbMath0977.05132MaRDI QIDQ5937949
Denise Amar, Olivier Togni, Andre Raspaud
Publication date: 21 January 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Applications of graph theory (05C90) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
Analysis of a heuristic for acyclic edge colouring ⋮ Acyclic chromatic index of chordless graphs ⋮ Forwarding and optical indices of 4-regular circulant networks ⋮ The undirected optical indices of complete \(m\)-ary trees ⋮ Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ A survey on Knödel graphs. ⋮ Acyclic Edge Coloring of Triangle‐Free Planar Graphs ⋮ Adjacent vertex distinguishing acyclic edge coloring of the Cartesian product of graphs ⋮ Acyclic edge coloring of subcubic graphs ⋮ Forwarding and optical indices of a graph ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ Optical Routing of Uniform Instances in Cayley Graphs
This page was built for publication: All-to-all wavelength-routing in all-optical compound networks
