On the 2-Dimensional Channel Assignment Problem

DOI10.1109/TC.1984.5009310zbMath0528.68046OpenAlexW2061279153MaRDI QIDQ3309078

No author found.

Publication date: 1984

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1984.5009310

zbMATH Keywords

graph coloringNP-completenessrectangle intersection graphs2-dimensional channel assignment

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Inverse chromatic number problems in interval and permutation graphs ⋮ Interval graphs and related topics

This page was built for publication: On the 2-Dimensional Channel Assignment Problem