An exact algorithm for the channel assignment problem

DOI10.1016/j.dam.2004.01.020zbMath1084.05069OpenAlexW2154475159WikidataQ57601547 ScholiaQ57601547MaRDI QIDQ1764816

Daniel Král'

Publication date: 22 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2004.01.020

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Communication theory (94A05)

Related Items (12)

Assigning channels via the meet-in-the-middle approach ⋮ Colorings with few colors: counting, enumeration and combinatorial bounds ⋮ Distance three labelings of trees ⋮ On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Channel assignment via fast zeta transform ⋮ Determining the \(L(2,1)\)-span in polynomial space ⋮ Labeling planar graphs with a condition at distance two ⋮ Distance constrained labelings of planar graphs with no short cycles ⋮ Graph labellings with variable weights, a survey ⋮ Models and solution techniques for frequency assignment problems ⋮ Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds ⋮ Distance constrained labelings of \(K_{4}\)-minor free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the complexity of the chromatic number problem
• Channel assignment on graphs of bounded treewidth
• On the span in channel assignment problems: Bounds, computing and counting
• Arrangements, channel assignments, and associated polynomials
• Labelling Graphs with a Condition at Distance 2
• A Theorem about the Channel Assignment Problem
• Fixed-parameter complexity of \(\lambda\)-labelings

This page was built for publication: An exact algorithm for the channel assignment problem