Please login to be able to save your searches and receive alerts for new content matching your search criteria.
We study the wavelength problem and arc (edge) congestion problem for communicating permutation instances on a ring. We prove the best possible upper bounds on the number of wavelengths and arc (edge) congestion in both directed and undirected cases.