Channel assignment via fast zeta transform

DOI10.1016/J.IPL.2011.05.008MaRDI QIDQ1944122zbMATH OpenOpenAlexFDO

Authors Marek Cygan, Łukasz Kowalik

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

exact algorithmchannel assignmentinclusion\(L(2,1)\)-labelingexclusion

Mathematics Subject Classification ID

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

Recommendations

• An exact algorithm for the channel assignment problem
• Assigning channels via the meet-in-the-middle approach
• Assigning channels via the meet-in-the-middle approach
• Tight lower bound for the channel assignment problem
• Tight lower bound for the channel assignment problem

Cites work

• An exact algorithm for the channel assignment problem
• Exact algorithms for \(L(2,1)\)-labeling of graphs
• On improved exact algorithms for \(L(2,1)\)-labeling of graphs
• On the span in channel assignment problems: Bounds, computing and counting
• Set partitioning via inclusion-exclusion
• The Time Complexity of Constraint Satisfaction

Cited in

(7)

• Determining the \(L(2,1)\)-span in polynomial space
• Assigning channels via the meet-in-the-middle approach
• Fast exact algorithm for L(2,1)-labeling of graphs
• Tight lower bound for the channel assignment problem
• An exact algorithm for the channel assignment problem
• Assigning channels via the meet-in-the-middle approach
• Tight lower bound for the channel assignment problem

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

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