Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network

DOI10.1023/A:1009759916586zbMATH Open0883.68014OpenAlexW1596146664MaRDI QIDQ1369751FDOQ1369751

Peng-Jun Wan

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

zbMATH Keywords

hypercube cluster interconnection topologyscalable multi-star optical networks

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Communication networks in operations research (90B18) Computer system organization (68M99)

Cited In (21)

• BCH codes and distance multi- or fractional colorings in hypercubes asymptotically
• Two coloring problems on matrix graphs
• Graph 2-rankings
• Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs
• Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs
• New results on two hypercube coloring problems
• Polyhedral studies for minimum‐span graph labelling with integer distance constraints
• Exact distance graphs of product graphs
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• A distance-labelling problem for hypercubes
• On a hypercube coloring problem
• The chromatic number of the square of the $8$-cube
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• An optimal square coloring of planar graphs
• A channel assignment problem for optical networks modelled by Cayley graphs
• On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
• A coloring problem on the \(n\)-cube
• New bounds on a hypercube coloring problem.
• Silver cubes
• Distance colorings of hypercubes from \(\mathbb{Z}_2 \mathbb{Z}_4\)-linear codes
• Injective coloring of graphs revisited

   Recommendations

• Title not available (Why is that?) 👍 👎
• Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs 👍 👎
• Transmission schedules for hypercube interconnection in WDM optical passive star networks 👍 👎

This page was built for publication: Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369751)