{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:32:27Z","timestamp":1761561147642},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9055-7","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T21:03:41Z","timestamp":1175288621000},"page":"249-257","source":"Crossref","is-referenced-by-count":26,"title":["Recent progress in mathematics and engineering on optimal graph labellings with distance conditions"],"prefix":"10.1007","volume":"14","author":[{"given":"Jerrold R.","family":"Griggs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua Teresa","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"issue":"4","key":"9055_CR1","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1109\/TVT.2003.814231","volume":"52","author":"S Anand","year":"2003","unstructured":"Anand S, Sridharan A, Sivarajan KN (2003) Performance analysis of channelized cellular systems with dynamic channel allocation. IEEE Trans Veh Tech 52(4):847\u2013859","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/90.311622","volume":"2","author":"P Barcaccia","year":"1994","unstructured":"Barcaccia P, Bonuccelli MA (1994) Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems. IEEE\/ACM Trans Netw 2:247\u2013251","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"2","key":"9055_CR3","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/25.923049","volume":"50","author":"R Battiti","year":"2001","unstructured":"Battiti R, Bertossi A, Cavallaro D (2001) A randomized saturation degree heuristic for channel assignment in cellular radio networks. IEEE Trans Veh Tech 50(2):364\u2013374","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR4","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1109\/90.413218","volume":"3","author":"AA Bertossi","year":"1995","unstructured":"Bertossi AA, Bonuccelli MA (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE\/ACM Trans Netw 3:441\u2013449","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9055_CR5","doi-asserted-by":"crossref","unstructured":"Bertossi AA, Pinotti CM, Rizzi R, Shende AM (2003) Channel assignment in honeycomb networks. In: 8th Italian conf on theor comp sci (ICTCS2003). Lecture notes in computer science, vol\u00a02841, pp\u00a0150\u2013162","DOI":"10.1007\/978-3-540-45208-9_13"},{"key":"9055_CR6","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/TPDS.2003.1189581","volume":"14","author":"AA Bertossi","year":"2003","unstructured":"Bertossi AA, Pinotti CM, Tan RB (2003) Channel assignment with separation for interference avoidance in wireless networks. IEEE Trans Parallel Distributed Syst 14:222\u2013235","journal-title":"IEEE Trans Parallel Distributed Syst"},{"key":"9055_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1052623402410181","volume":"15","author":"HL Bodlaender","year":"2004","unstructured":"Bodlaender HL, Broersma H, Fomin FV, Pyatkin AV, Woeginger GJ (2004) Radio labeling with preassigned frequencies. SIAM J Optim 15:1\u201316","journal-title":"SIAM J Optim"},{"key":"9055_CR8","doi-asserted-by":"crossref","unstructured":"Brown TX (1999) Dynamic channel assignment in shotgun cellular systems. In: Proceedings of the IEEE radio and wireless conference (RAWCON99), pp\u00a0147\u2013150","DOI":"10.1109\/RAWCON.1999.810951"},{"key":"9055_CR9","unstructured":"Calamoneri T (2003) Exact solution of a class of frequency assignment problems in cellular networks and other regular grids (extended abstract). In: 8th Italian conference on theoretical computer science (ICTCS\u201903). Lecture notes in computer science, vol\u00a02841, pp\u00a0150\u2013162"},{"key":"9055_CR10","doi-asserted-by":"crossref","first-page":"1534","DOI":"10.1016\/j.disc.2005.04.024","volume":"306","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri T, Pelc A, Petreschi R (2006) Labeling trees with a condition at distance two. Discret Math 306:1534\u20131539","journal-title":"Discret Math"},{"key":"9055_CR11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang GJ, Kuo D (1996) The L(2,1)-labeling problem on graphs. SIAM J Discret Math 9:309\u2013316","journal-title":"SIAM J Discret Math"},{"key":"9055_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0012-365X(99)00400-8","volume":"220","author":"GJ Chang","year":"2002","unstructured":"Chang GJ, Ke W-T, Kuo D, Liu DD-F, Yeh RK (2002) On L(d,1)-labelings of graphs. Discret Math 220:57\u201366","journal-title":"Discret Math"},{"key":"9055_CR13","first-page":"77","volume":"33","author":"G Chartrand","year":"2001","unstructured":"Chartrand G, Erwin D, Zhang P, Harary F (2001) Radio labelings of graphs. Bull ICA 33:77\u201385","journal-title":"Bull ICA"},{"issue":"2","key":"9055_CR14","first-page":"645","volume":"4","author":"CS Chen","year":"2005","unstructured":"Chen CS, Wong WS (2005) Bandwidth allocation for wireless multimedia systems with most regular sequences. IEEE Trans Wirel Commun 4(2):635\u2013645","journal-title":"IEEE Trans Wirel Commun"},{"issue":"6","key":"9055_CR15","first-page":"1385","volume":"51","author":"FA Cruz-Perez","year":"2002","unstructured":"Cruz-Perez FA, Lara-Rodriguez D (2002) Distributed dynamic channel assignment with violation to the reuse pattern for microcellular networks. IEEE Trans Veh Tech 51(6):1357\u20131385","journal-title":"IEEE Trans Veh Tech"},{"issue":"5","key":"9055_CR16","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1109\/TVT.2002.801766","volume":"51","author":"M-S Do","year":"2002","unstructured":"Do M-S, Park Y, Lee J-Y (2002) Channel assignment with QoS guarantees for a gulticode CDMA system. IEEE Trans Veh Tech 51(5):935\u2013948","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR17","doi-asserted-by":"crossref","unstructured":"Dubhashi A, MVS S, Pati A, Ramaprasad S, Shende AM (2002) Channel assignment for wireless networks modelled as d-dimensional square grids. Lecture notes in computer science, vol\u00a02571, 130\u2013141","DOI":"10.1007\/3-540-36385-8_14"},{"issue":"1","key":"9055_CR18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/25.992069","volume":"51","author":"XN Fernando","year":"2002","unstructured":"Fernando XN, Fapojuwo AO (2002) A Viterbi-like algorithm with adaptive clustering for channel assignment in cellular radio networks. IEEE Trans Veh Tech 51(1):73\u201387","journal-title":"IEEE Trans Veh Tech"},{"issue":"5","key":"9055_CR19","first-page":"71","volume":"86","author":"T Fujii","year":"2003","unstructured":"Fujii T, Nakazima N (2003) Radio channel assignment system for cellular mobile communications. Electr Commun Jpn Part 1 86(5):59\u201371","journal-title":"Electr Commun Jpn Part 1"},{"key":"9055_CR20","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/T-VT.1982.23925","volume":"31","author":"A Gamst","year":"1982","unstructured":"Gamst A (1982) Homogeneous distribution of frequencies in a regular hexagonal cell system. IEEE Trans Veh Tech 31:132\u2013144","journal-title":"IEEE Trans Veh Tech"},{"issue":"1","key":"9055_CR21","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"VT-35","author":"A Gamst","year":"1986","unstructured":"Gamst A (1986) Some lower bounds for a class of frequency assignment problems. IEEE Trans Veh Tech VT-35(1):8\u201314","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR22","first-page":"141","volume":"109","author":"JP Georges","year":"1995","unstructured":"Georges JP, Mauro DW (1995) Generalized vertex labelings with a condition at distance two. Congr Numer 109:141\u2013159","journal-title":"Congr Numer"},{"key":"9055_CR23","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0012-365X(02)00750-1","volume":"269","author":"JP Georges","year":"2003a","unstructured":"Georges JP, Mauro DW (2003a) Labeling trees with a condition at distance two. Discret Math 269:127\u2013148","journal-title":"Discret Math"},{"key":"9055_CR24","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1137\/S0895480101391247","volume":"17","author":"JP Georges","year":"2003b","unstructured":"Georges JP, Mauro DW (2003b) On Regular graphs optimally labeled with a condition at distance two. SIAM J Discret Math 17:320\u2013331","journal-title":"SIAM J Discret Math"},{"issue":"4","key":"9055_CR25","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1109\/TVT.2003.808806","volume":"52","author":"SC Ghosh","year":"2003","unstructured":"Ghosh SC, Sinha BP, Das N (2003) Channel assignment using genetic algorithm based on geometric symmetry. IEEE Trans Veh Tech 52(4):860\u2013875","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR26","first-page":"379","volume":"21","author":"JR Griggs","year":"2000","unstructured":"Griggs JR (2000) Author\/judge\u2019s commentary: the outstanding channel assignment papers. UMAP J 21:379\u2013386","journal-title":"UMAP J"},{"key":"9055_CR27","doi-asserted-by":"crossref","unstructured":"Griggs JR, Jin XT (2005) Optimal channel assignments for lattices with conditions at distance two. In: 5th IEEE international parallel and distributed processing symposium (International workshop on wireless, mobile, and ad hoc networks), extended abstract","DOI":"10.1109\/IPDPS.2005.309"},{"key":"9055_CR28","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/S0895480105446708","volume":"20","author":"JR Griggs","year":"2006","unstructured":"Griggs JR, Jin XT (2006) Real number graph labellings with distance conditions. SIAM J Discret Math 20:302\u2013327","journal-title":"SIAM J Discret Math"},{"key":"9055_CR29","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discret Math 5:586\u2013595","journal-title":"SIAM J Discret Math"},{"key":"9055_CR30","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/(SICI)1099-1190(200003\/04)10:2<59::AID-NEM354>3.0.CO;2-T","volume":"10","author":"A Hac","year":"2000","unstructured":"Hac A, Chen Z (2000) A hybrid channel allocation method for wireless communication networks. Int J Netw Manag 10:59\u201374","journal-title":"Int J Netw Manag"},{"key":"9055_CR31","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68:1497\u20131514","journal-title":"Proc IEEE"},{"issue":"12","key":"9055_CR32","first-page":"1208","volume":"14","author":"S-Y Hsieh","year":"2003","unstructured":"Hsieh S-Y (2003) A simple and fast parallel coloring algorithm for distance-hereditary graphs. IEEE Trans Parallel Distributed Syst 14(12):1201\u20131208","journal-title":"IEEE Trans Parallel Distributed Syst"},{"issue":"6","key":"9055_CR33","first-page":"1396","volume":"51","author":"Z He","year":"2002","unstructured":"He Z, Zhang Y, Wei C, Wang J (2002) A multistage self-organizing algorithm combined transiently chaotic neural network for cellular channel assignment. IEEE Trans Veh Tech 51(6):1386\u20131396","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR34","unstructured":"Jin XT (2005) Real number graph labeling with distance conditions. PhD dissertation, Department of Mathematics, University of South Carolina"},{"key":"9055_CR35","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/nav.20041","volume":"52","author":"XT Jin","year":"2005","unstructured":"Jin XT, Yeh RK (2005) Graph distance-dependent labeling related to code assignment in computer networks. Naval Res Logist 52:159\u2013164","journal-title":"Naval Res Logist"},{"key":"9055_CR36","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/j.dam.2004.01.019","volume":"145","author":"PK Jha","year":"2005","unstructured":"Jha PK, Klavzar S, Vesel A (2005) L(2,1)-labeling of direct product of paths and cycles. Discret Appl Math 145:317\u2013325","journal-title":"Discret Appl Math"},{"issue":"4","key":"9055_CR37","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.ipl.2005.01.007","volume":"94","author":"D Korze","year":"2005","unstructured":"Korze D, Vesel A (2005) L(2,1)-Labeling of strong products of cycles. Inf Process Lett 94(4):183\u2013190","journal-title":"Inf Process Lett"},{"key":"9055_CR38","first-page":"381","volume":"2","author":"A Kramling","year":"2002","unstructured":"Kramling A, Scheibenbogen M, Walke B (2002) Dynamic channel allocation in wireless ATM networks. Wirel Netw 2:381\u2013398","journal-title":"Wirel Netw"},{"key":"9055_CR39","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1109\/25.653071","volume":"46","author":"RA Leese","year":"1997","unstructured":"Leese RA (1997) A unified approach to the assignment of radio channels on a regular hexagonal grid. IEEE Trans Veh Tech 46:968\u2013979","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR40","doi-asserted-by":"crossref","unstructured":"Leese R, Hurley S (2002) Methods and algorithms for radio channel assignment. Oxford lecture series in mathematics and its applications, vol\u00a023","DOI":"10.1093\/oso\/9780198503149.001.0001"},{"issue":"5","key":"9055_CR41","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1109\/TVT.2002.800634","volume":"51","author":"R Montemanni","year":"2002","unstructured":"Montemanni R, Smith DH, Allen SM (2002) An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference. IEEE Trans Veh Tech 51(5):949\u2013953","journal-title":"IEEE Trans Veh Tech"},{"issue":"3","key":"9055_CR42","first-page":"1159","volume":"54","author":"JNJ Moon","year":"2005","unstructured":"Moon JNJ, Huges LA, Smith DH (2005) Assignment of frequency lists in frequency hopping networks. IEEE Trans Veh Tech 54(3):1147\u20131159","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR43","doi-asserted-by":"crossref","unstructured":"Panda BS, Kumar M, Das SK (2004) Optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids. Lecture notes in computer science, vol\u00a03326, 424\u2013434","DOI":"10.1007\/978-3-540-30536-1_47"},{"key":"9055_CR44","unstructured":"Pham TT, Perkis A (2000) An introduction to radio resource management in cellular systems. In: Proc NORSIG"},{"key":"9055_CR45","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1023\/A:1019126406181","volume":"5","author":"S Ramanathan","year":"1999","unstructured":"Ramanathan S (1999) A unified framework and algorithm for channel assignment in wireless networks. Wirel Netw 5:81\u201394","journal-title":"Wirel Netw"},{"key":"9055_CR46","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"Roberts FS (1991) T-colorings of graphs: recent results and open problems. Discret Math 93:229\u2013245","journal-title":"Discret Math"},{"key":"9055_CR47","unstructured":"Roberts FS (2003) Working group agenda, DIMACS\/DIMATIA\/Renyi working group on graph colorings and their generalizations. Posted at http:\/\/dimacs.rutgers.edu\/Workshops\/GraphColor\/main.html"},{"issue":"5","key":"9055_CR48","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1109\/TVT.2002.801768","volume":"51","author":"S Sarkar","year":"2002","unstructured":"Sarkar S, Sivarajan KN (2002) Channel assignment algorithms satisfying cochannel and adjacent channel reuse. IEEE Trans Veh Tech 515:954\u2013967","journal-title":"IEEE Trans Veh Tech"},{"issue":"4","key":"9055_CR49","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1109\/25.875238","volume":"49","author":"DH Smith","year":"2000","unstructured":"Smith DH, Hurley S, Allen SM (2000) A new lower bound for the channel assignment problem. IEEE Trans Veh Tech 49(4):1265\u20131271","journal-title":"IEEE Trans Veh Tech"},{"issue":"3","key":"9055_CR50","first-page":"685","volume":"46","author":"CW Sung","year":"1997","unstructured":"Sung CW, Wong WS (1997) Sequential packing algorithm for channel assignment under cochannel and adjacent-channel interference constraint. IEEE Trans Veh Tech 46(3):676\u2013685","journal-title":"IEEE Trans Veh Tech"},{"key":"9055_CR51","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/(SICI)1097-0118(199812)29:4<263::AID-JGT5>3.0.CO;2-V","volume":"29","author":"van den J Heuvel","year":"1998","unstructured":"van den Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channel assignment. J Graph Theory 29:263\u2013283","journal-title":"J Graph Theory"},{"key":"9055_CR52","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1023\/A:1020325602854","volume":"8","author":"RM Whitaker","year":"2002","unstructured":"Whitaker RM, Hurley S, Allen SM (2002) Optimising channel assignments for private mobile radio networks in the UHF 2 band. Wirel Netw 8:587\u2013595","journal-title":"Wirel Netw"},{"key":"9055_CR53","first-page":"21","volume":"65","author":"P Zhang","year":"2002","unstructured":"Zhang P (2002) Radio labelings of cycles. Ars Comb 65:21\u201332","journal-title":"Ars Comb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9055-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9055-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9055-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T14:53:52Z","timestamp":1707749632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9055-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":53,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9055"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9055-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}