Frequency assignment problem in networks with limited spectrum

DOI10.1007/s10100-016-0462-7zbMath1397.90086OpenAlexW2560459075MaRDI QIDQ1788938

Jin Xu, Aleksander Vesel, Zehui Shao

Publication date: 9 October 2018

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-016-0462-7

zbMATH Keywords

square latticefrequency assignmenthexagonal lattice\((s,t,r)\)-relaxed \(k\)-\(L(3,2,1)\)-labeling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of graph theory (05C90) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

Editorial ⋮ Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR

Cites Work

• Unnamed Item
• Unnamed Item
• \(L(3,2,1)\)-labeling of triangular and toroidal grids
• \(L(3,2,1)\)-labeling of graphs
• \(L(h,1)\)-labeling subclasses of planar graphs
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the triangular lattice
• The dynamic frequency assignment problem
• On \((s,t)\)-relaxed \(L(2,1)\)-labelings of the square lattice
• L(h,k)-labelling for octagonal grid
• Exact Algorithms for L(2,1)-Labeling of Graphs
• Labelling Graphs with a Condition at Distance 2
• Graph labeling and radio channel assignment
• The $L(2,1)$-Labeling Problem on Graphs
• On \((s,t)\)-relaxed \(L(2,1)\)-labeling of graphs

This page was built for publication: Frequency assignment problem in networks with limited spectrum