Pages that link to "Item:Q1752619"
From MaRDI portal
The following pages link to Channel assignment problem and \(n\)-fold \(t\)-separated \(L(j_1,j_2,\dots,j_m)\)-labeling of graphs (Q1752619):
Displaying 6 items.
- \(L(p,q)\)-label coloring problem with application to channel allocation (Q778676) (← links)
- Radio channel assignment on 2-dimensional lattices (Q1400797) (← links)
- Optimal channel assignment and \(L(p,1)\)-labeling (Q1630278) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Distance three labellings for <i>K</i> <sub> <i>n</i> </sub>×<i>K</i> <sub>2</sub> (Q2855724) (← links)
- Distributed Computing - IWDC 2004 (Q5465906) (← links)