Channel assignment via fast zeta transform

DOI10.1016/j.ipl.2011.05.008zbMath1260.68170OpenAlexW1770176175MaRDI QIDQ1944122

Łukasz Kowalik, Marek Cygan

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.008

zbMATH Keywords

channel assignmentexact algorithm\(L(2,1)\)-labelinginclusionexclusion

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Assigning channels via the meet-in-the-middle approach ⋮ Fast exact algorithm for \(L(2,1)\)-labeling of graphs ⋮ Determining the \(L(2,1)\)-span in polynomial space

Cites Work

• Exact algorithms for \(L(2,1)\)-labeling of graphs
• An exact algorithm for the channel assignment problem
• On the span in channel assignment problems: Bounds, computing and counting
• On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
• The Time Complexity of Constraint Satisfaction
• Set Partitioning via Inclusion-Exclusion

This page was built for publication: Channel assignment via fast zeta transform