Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
From MaRDI portal
Publication:1369751
DOI10.1023/A:1009759916586zbMath0883.68014OpenAlexW1596146664MaRDI QIDQ1369751
Publication date: 20 October 1997
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009759916586
Applications of mathematical programming (90C90) Communication networks in operations research (90B18) Combinatorial optimization (90C27) Computer system organization (68M99)
Related Items (21)
A channel assignment problem for optical networks modelled by Cayley graphs ⋮ Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges ⋮ BCH codes and distance multi- or fractional colorings in hypercubes asymptotically ⋮ An optimal square coloring of planar graphs ⋮ Injective coloring of graphs revisited ⋮ Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs ⋮ New results on two hypercube coloring problems ⋮ Graph 2-rankings ⋮ The chromatic number of the square of the $8$-cube ⋮ Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes ⋮ On a hypercube coloring problem ⋮ Polyhedral studies for minimum‐span graph labelling with integer distance constraints ⋮ On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs ⋮ Exact distance graphs of product graphs ⋮ A distance-labelling problem for hypercubes ⋮ Silver cubes ⋮ Two coloring problems on matrix graphs ⋮ Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs ⋮ A coloring problem on the \(n\)-cube ⋮ New bounds on a hypercube coloring problem. ⋮ Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
This page was built for publication: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network
