Utility and expandability of channel assignments.

MaRDI QIDQ5248306zbMATH OpenFDO

Authors Patrick Bahls, Thomas Mahoney

Publication date 6 May 2015

zbMATH Keywords

channel assignmentgraph labelinggraph utility

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Graph labeling and radio channel assignment
• Edge span of L(d,1)-labeling on some graphs
• Optimal channel assignment and \(L(p,1)\)-labeling
• Graph labellings with variable weights, a survey
• Channel assignment problem and n-fold t-separated L(j₁,j₂,,j_m)-labeling of graphs

Cited in

(2)

• Fully available group of channels with controlled access
• Channel assignment with large demands

This page was built for publication: Utility and expandability of channel assignments.

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