A channel assignment problem for optical networks modelled by Cayley graphs
type: Item
instance of: scholarly article
title: A channel assignment problem for optical networks modelled by Cayley graphs
zbMATH Open document ID: 1071.68085
DOI: 10.1016/S0304-3975(03)00394-3
author: Sanming Zhou
published in: Theoretical Computer Science
publication date: 2004-10-27T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 94C05
zbMATH DE Number: 2111070
zbMATH Keywords: Channel assignment
zbMATH Keywords: Optical network
zbMATH Keywords: Cayley graph
zbMATH Keywords: Hypercube
MaRDI profile type: Publication
cites work: A new 5‐arc‐transitive cubic graph
cites work: Labelling Graphs with a Condition at Distance 2
cites work: Q4934401
cites work: Q4352273
cites work: Q5606540
cites work: Q4523707
cites work: On automorphisms of Cayley graphs
cites work: A coloring problem on the \(n\)-cube
cites work: Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
cites work: Q4146884
cites work: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
cites work: Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs
cites work: Q4798526
cites work: Labelling Cayley Graphs on Abelian Groups
full work available at URL: s0304-3975(03)00394-3
OpenAlex ID: W2104103621
description: scientific article; zbMATH DE number 2111070