Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem

DOI10.1016/j.jda.2006.07.004zbMath1130.68023OpenAlexW2075947755MaRDI QIDQ2466024

Jinjiang Yuan, Sanming Zhou, Jianying Zhang

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.07.004

zbMATH Keywords

ringpermutationinvolutionroutingwavelength assignment

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Paths and cycles (05C38) Discrete location and assignment (90B80)

Related Items (1)

Forwarding and optical indices of 4-regular circulant networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge-disjoint paths in planar graphs
• The permutation-path coloring problem on trees.
• Efficient collective communciation in optical networks
• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
• The Complexity of Coloring Circular Arcs and Chords
• Efficient routing in optical networks
• The Ring Loading Problem
• Routing permutations on a graph
• The complexity of path coloring and call scheduling
• Routing permutations and 2-1 routing requests in the hypercube

This page was built for publication: Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem