메뉴 건너뛰기




Volumn 14, Issue 2-3, 2007, Pages 249-257

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

Author keywords

Channel assignment problem; Graph labelling

Indexed keywords

COMBINATORIAL OPTIMIZATION; MATHEMATICAL MODELS; NUMBER THEORY; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

EID: 34548065477     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-007-9055-7     Document Type: Conference Paper
Times cited : (29)

References (53)
  • 1
    • 0041409822 scopus 로고    scopus 로고
    • Performance analysis of channelized cellular systems with dynamic channel allocation
    • 4
    • Anand S, Sridharan A, Sivarajan KN (2003) Performance analysis of channelized cellular systems with dynamic channel allocation. IEEE Trans Veh Tech 52(4):847-859
    • (2003) IEEE Trans Veh Tech , vol.52 , pp. 859-847
    • Anand, S.1    Sridharan, A.2    Sivarajan, K.N.3
  • 2
    • 0028459848 scopus 로고
    • Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems
    • Barcaccia P, Bonuccelli MA (1994) Polynomial time optimal algorithms for time slot assignment of variable bandwidth systems. IEEE/ACM Trans Netw 2:247-251
    • (1994) IEEE/ACM Trans Netw , vol.2 , pp. 247-251
    • Barcaccia, P.1    Bonuccelli, M.A.2
  • 3
    • 0035268622 scopus 로고    scopus 로고
    • A randomized saturation degree heuristic for channel assignment in cellular radio networks
    • 2
    • 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-374
    • (2001) IEEE Trans Veh Tech , vol.50 , pp. 374-364
    • Battiti, R.1    Bertossi, A.2    Cavallaro, D.3
  • 4
    • 0029354351 scopus 로고
    • Code assignment for hidden terminal interference avoidance in multihop packet radio networks
    • Bertossi AA, Bonuccelli MA (1995) Code assignment for hidden terminal interference avoidance in multihop packet radio networks. IEEE/ACM Trans Netw 3:441-449
    • (1995) IEEE/ACM Trans Netw , vol.3 , pp. 441-449
    • Bertossi, A.A.1    Bonuccelli, M.A.2
  • 5
    • 0142187693 scopus 로고    scopus 로고
    • Channel assignment in honeycomb networks
    • 8th Italian conf on theor comp sci (ICTCS2003)
    • 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 2841, pp 150-162
    • (2003) Lecture Notes in Computer Science , vol.2841 , pp. 150-162
    • Bertossi, A.A.1    Pinotti, C.M.2    Rizzi, R.3    Shende, A.M.4
  • 6
    • 0037963009 scopus 로고    scopus 로고
    • Channel assignment with separation for interference avoidance in wireless networks
    • Bertossi AA, Pinotti CM, Tan RB (2003) Channel assignment with separation for interference avoidance in wireless networks. IEEE Trans Parallel Distributed Syst 14:222-235
    • (2003) IEEE Trans Parallel Distributed Syst , vol.14 , pp. 222-235
    • Bertossi, A.A.1    Pinotti, C.M.2    Tan, R.B.3
  • 9
    • 33746309941 scopus 로고    scopus 로고
    • Exact solution of a class of frequency assignment problems in cellular networks and other regular grids (extended abstract)
    • 8th Italian conference on theoretical computer science (ICTCS'03)
    • 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'03). Lecture notes in computer science, vol 2841, pp 150-162
    • (2003) Lecture Notes in Computer Science , vol.2841 , pp. 150-162
    • Calamoneri, T.1
  • 10
    • 33745676997 scopus 로고    scopus 로고
    • Labeling trees with a condition at distance two
    • Calamoneri T, Pelc A, Petreschi R (2006) Labeling trees with a condition at distance two. Discret Math 306:1534-1539
    • (2006) Discret Math , vol.306 , pp. 1534-1539
    • Calamoneri, T.1    Pelc, A.2    Petreschi, R.3
  • 11
    • 0030367240 scopus 로고    scopus 로고
    • The L(2,1)-labeling problem on graphs
    • Chang GJ, Kuo D (1996) The L(2,1)-labeling problem on graphs. SIAM J Discret Math 9:309-316
    • (1996) SIAM J Discret Math , vol.9 , pp. 309-316
    • Chang, G.J.1    Kuo, D.2
  • 14
    • 17144377065 scopus 로고    scopus 로고
    • Bandwidth allocation for wireless multimedia systems with most regular sequences
    • 2
    • Chen CS, Wong WS (2005) Bandwidth allocation for wireless multimedia systems with most regular sequences. IEEE Trans Wirel Commun 4(2):635-645
    • (2005) IEEE Trans Wirel Commun , vol.4 , pp. 645-635
    • Chen, C.S.1    Wong, W.S.2
  • 15
    • 0036879996 scopus 로고    scopus 로고
    • Distributed dynamic channel assignment with violation to the reuse pattern for microcellular networks
    • 6
    • 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-1385
    • (2002) IEEE Trans Veh Tech , vol.51 , pp. 1385-1357
    • Cruz-Perez, F.A.1    Lara-Rodriguez, D.2
  • 16
    • 0036766475 scopus 로고    scopus 로고
    • Channel assignment with QoS guarantees for a gulticode CDMA system
    • 5
    • 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-948
    • (2002) IEEE Trans Veh Tech , vol.51 , pp. 935-948
    • Do, M.-S.1    Park, Y.2    Lee, J.-Y.3
  • 18
    • 0036247923 scopus 로고    scopus 로고
    • A Viterbi-like algorithm with adaptive clustering for channel assignment in cellular radio networks
    • 1
    • 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-87
    • (2002) IEEE Trans Veh Tech , vol.51 , pp. 87-73
    • Fernando, X.N.1    Fapojuwo, A.O.2
  • 19
    • 0037407005 scopus 로고    scopus 로고
    • Radio channel assignment system for cellular mobile communications
    • 5
    • Fujii T, Nakazima N (2003) Radio channel assignment system for cellular mobile communications. Electr Commun Jpn Part 1 86(5):59-71
    • (2003) Electr Commun Jpn Part 1 , vol.86 , pp. 71-59
    • Fujii, T.1    Nakazima, N.2
  • 20
    • 0020167692 scopus 로고
    • Homogeneous distribution of frequencies in a regular hexagonal cell system
    • Gamst A (1982) Homogeneous distribution of frequencies in a regular hexagonal cell system. IEEE Trans Veh Tech 31:132-144
    • (1982) IEEE Trans Veh Tech , vol.31 , pp. 132-144
    • Gamst, A.1
  • 21
    • 0022665248 scopus 로고
    • Some lower bounds for a class of frequency assignment problems
    • 1
    • Gamst A (1986) Some lower bounds for a class of frequency assignment problems. IEEE Trans Veh Tech VT-35(1):8-14
    • (1986) IEEE Trans Veh Tech , vol.VT-35 , pp. 8-14
    • Gamst, A.1
  • 22
    • 0037566612 scopus 로고
    • Generalized vertex labelings with a condition at distance two
    • Georges JP, Mauro DW (1995) Generalized vertex labelings with a condition at distance two. Congr Numer 109:141-159
    • (1995) Congr Numer , vol.109 , pp. 141-159
    • Georges, J.P.1    Mauro, D.W.2
  • 23
    • 0038480143 scopus 로고    scopus 로고
    • Labeling trees with a condition at distance two
    • Georges JP, Mauro DW (2003a) Labeling trees with a condition at distance two. Discret Math 269:127-148
    • (2003) Discret Math , vol.269 , pp. 127-148
    • Georges, J.P.1    Mauro, D.W.2
  • 24
    • 2542461499 scopus 로고    scopus 로고
    • On Regular graphs optimally labeled with a condition at distance two
    • Georges JP, Mauro DW (2003b) On Regular graphs optimally labeled with a condition at distance two. SIAM J Discret Math 17:320-331
    • (2003) SIAM J Discret Math , vol.17 , pp. 320-331
    • Georges, J.P.1    Mauro, D.W.2
  • 25
    • 0041409821 scopus 로고    scopus 로고
    • Channel assignment using genetic algorithm based on geometric symmetry
    • 4
    • Ghosh SC, Sinha BP, Das N (2003) Channel assignment using genetic algorithm based on geometric symmetry. IEEE Trans Veh Tech 52(4):860-875
    • (2003) IEEE Trans Veh Tech , vol.52 , pp. 860-875
    • Ghosh, S.C.1    Sinha, B.P.2    Das, N.3
  • 26
    • 33746322025 scopus 로고    scopus 로고
    • Author/judge's commentary: The outstanding channel assignment papers
    • Griggs JR (2000) Author/judge's commentary: the outstanding channel assignment papers. UMAP J 21:379-386
    • (2000) UMAP J , vol.21 , pp. 379-386
    • Griggs, J.R.1
  • 28
    • 34247166461 scopus 로고    scopus 로고
    • Real number graph labellings with distance conditions
    • Griggs JR, Jin XT (2006) Real number graph labellings with distance conditions. SIAM J Discret Math 20:302-327
    • (2006) SIAM J Discret Math , vol.20 , pp. 302-327
    • Griggs, J.R.1    Jin, X.T.2
  • 29
    • 0000801332 scopus 로고
    • Labelling graphs with a condition at distance 2
    • Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discret Math 5:586-595
    • (1992) SIAM J Discret Math , vol.5 , pp. 586-595
    • Griggs, J.R.1    Yeh, R.K.2
  • 30
    • 0034165308 scopus 로고    scopus 로고
    • A hybrid channel allocation method for wireless communication networks
    • Hac A, Chen Z (2000) A hybrid channel allocation method for wireless communication networks. Int J Netw Manag 10:59-74
    • (2000) Int J Netw Manag , vol.10 , pp. 59-74
    • Hac, A.1    Chen, Z.2
  • 31
    • 0019213982 scopus 로고
    • Frequency assignment: Theory and applications
    • Hale WK (1980) Frequency assignment: theory and applications. Proc IEEE 68:1497-1514
    • (1980) Proc IEEE , vol.68 , pp. 1497-1514
    • Hale, W.K.1
  • 32
    • 0742303618 scopus 로고    scopus 로고
    • A simple and fast parallel coloring algorithm for distance-hereditary graphs
    • 12
    • Hsieh S-Y (2003) A simple and fast parallel coloring algorithm for distance-hereditary graphs. IEEE Trans Parallel Distributed Syst 14(12):1201-1208
    • (2003) IEEE Trans Parallel Distributed Syst , vol.14 , pp. 1208-1201
    • Hsieh, S.-Y.1
  • 33
    • 0036879614 scopus 로고    scopus 로고
    • A multistage self-organizing algorithm combined transiently chaotic neural network for cellular channel assignment
    • 6
    • 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-1396
    • (2002) IEEE Trans Veh Tech , vol.51 , pp. 1396-1386
    • He, Z.1    Zhang, Y.2    Wei, C.3    Wang, J.4
  • 35
    • 14644429722 scopus 로고    scopus 로고
    • Graph distance-dependent labeling related to code assignment in computer networks
    • Jin XT, Yeh RK (2005) Graph distance-dependent labeling related to code assignment in computer networks. Naval Res Logist 52:159-164
    • (2005) Naval Res Logist , vol.52 , pp. 159-164
    • Jin, X.T.1    Yeh, R.K.2
  • 36
    • 8344267498 scopus 로고    scopus 로고
    • L(2,1)-labeling of direct product of paths and cycles
    • Jha PK, Klavzar S, Vesel A (2005) L(2,1)-labeling of direct product of paths and cycles. Discret Appl Math 145:317-325
    • (2005) Discret Appl Math , vol.145 , pp. 317-325
    • Jha, P.K.1    Klavzar, S.2    Vesel, A.3
  • 37
    • 15844409022 scopus 로고    scopus 로고
    • L(2,1)-Labeling of strong products of cycles
    • 4
    • Korze D, Vesel A (2005) L(2,1)-Labeling of strong products of cycles. Inf Process Lett 94(4):183-190
    • (2005) Inf Process Lett , vol.94 , pp. 183-190
    • Korze, D.1    Vesel, A.2
  • 38
    • 33746303226 scopus 로고    scopus 로고
    • Dynamic channel allocation in wireless ATM networks
    • Kramling A, Scheibenbogen M, Walke B (2002) Dynamic channel allocation in wireless ATM networks. Wirel Netw 2:381-398
    • (2002) Wirel Netw , vol.2 , pp. 381-398
    • Kramling, A.1    Scheibenbogen, M.2    Walke, B.3
  • 39
    • 0031270671 scopus 로고    scopus 로고
    • A unified approach to the assignment of radio channels on a regular hexagonal grid
    • Leese RA (1997) A unified approach to the assignment of radio channels on a regular hexagonal grid. IEEE Trans Veh Tech 46:968-979
    • (1997) IEEE Trans Veh Tech , vol.46 , pp. 968-979
    • Leese, R.A.1
  • 41
    • 0036766703 scopus 로고    scopus 로고
    • An ANTS algorithm for the minimum-span frequency-assignment problem with multiple interference
    • 5
    • 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-953
    • (2002) IEEE Trans Veh Tech , vol.51 , pp. 953-949
    • Montemanni, R.1    Smith, D.H.2    Allen, S.M.3
  • 42
    • 21244503154 scopus 로고    scopus 로고
    • Assignment of frequency lists in frequency hopping networks
    • 3
    • Moon JNJ, Huges LA, Smith DH (2005) Assignment of frequency lists in frequency hopping networks. IEEE Trans Veh Tech 54(3):1147-1159
    • (2005) IEEE Trans Veh Tech , vol.54 , pp. 1159-1147
    • Moon, J.N.J.1    Huges, L.A.2    Smith, D.H.3
  • 43
    • 34548095212 scopus 로고    scopus 로고
    • Optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids
    • 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 3326, 424-434
    • (2004) Lecture Notes in Computer Science , vol.3326 , pp. 424-434
    • Panda, B.S.1    Kumar, M.2    Das, S.K.3
  • 44
    • 34548103358 scopus 로고    scopus 로고
    • An introduction to radio resource management in cellular systems
    • Pham TT, Perkis A (2000) An introduction to radio resource management in cellular systems. In: Proc NORSIG
    • (2000) Proc NORSIG
    • Pham, T.T.1    Perkis, A.2
  • 45
    • 0032658710 scopus 로고    scopus 로고
    • A unified framework and algorithm for channel assignment in wireless networks
    • Ramanathan S (1999) A unified framework and algorithm for channel assignment in wireless networks. Wirel Netw 5:81-94
    • (1999) Wirel Netw , vol.5 , pp. 81-94
    • Ramanathan, S.1
  • 46
    • 0013110657 scopus 로고
    • T-colorings of graphs: Recent results and open problems
    • Roberts FS (1991) T-colorings of graphs: recent results and open problems. Discret Math 93:229-245
    • (1991) Discret Math , vol.93 , pp. 229-245
    • Roberts, F.S.1
  • 48
    • 0036766439 scopus 로고    scopus 로고
    • Channel assignment algorithms satisfying cochannel and adjacent channel reuse
    • 5
    • Sarkar S, Sivarajan KN (2002) Channel assignment algorithms satisfying cochannel and adjacent channel reuse. IEEE Trans Veh Tech 515:954-967
    • (2002) IEEE Trans Veh Tech , vol.51 , pp. 954-967
    • Sarkar, S.1    Sivarajan, K.N.2
  • 49
    • 0034201991 scopus 로고    scopus 로고
    • A new lower bound for the channel assignment problem
    • 4
    • Smith DH, Hurley S, Allen SM (2000) A new lower bound for the channel assignment problem. IEEE Trans Veh Tech 49(4):1265-1271
    • (2000) IEEE Trans Veh Tech , vol.49 , pp. 1271-1265
    • Smith, D.H.1    Hurley, S.2    Allen, S.M.3
  • 50
    • 0031211647 scopus 로고    scopus 로고
    • Sequential packing algorithm for channel assignment under cochannel and adjacent-channel interference constraint
    • 3
    • 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-685
    • (1997) IEEE Trans Veh Tech , vol.46 , pp. 685-676
    • Sung, C.W.1    Wong, W.S.2
  • 51
    • 0032332606 scopus 로고    scopus 로고
    • Graph labeling and radio channel assignment
    • van den Heuvel J, Leese RA, Shepherd MA (1998) Graph labeling and radio channel assignment. J Graph Theory 29:263-283
    • (1998) J Graph Theory , vol.29 , pp. 263-283
    • Heuvel, J.1    Leese, R.A.2    Shepherd, M.A.3
  • 52
    • 0036846335 scopus 로고    scopus 로고
    • Optimising channel assignments for private mobile radio networks in the UHF 2 band
    • Whitaker RM, Hurley S, Allen SM (2002) Optimising channel assignments for private mobile radio networks in the UHF 2 band. Wirel Netw 8:587-595
    • (2002) Wirel Netw , vol.8 , pp. 587-595
    • Whitaker, R.M.1    Hurley, S.2    Allen, S.M.3
  • 53
    • 0142231044 scopus 로고    scopus 로고
    • Radio labelings of cycles
    • Zhang P (2002) Radio labelings of cycles. Ars Comb 65:21-32
    • (2002) Ars Comb , vol.65 , pp. 21-32
    • Zhang, P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.