메뉴 건너뛰기




Volumn 94, Issue 4, 2005, Pages 183-190

L(2,1)-labeling of strong products of cycles

Author keywords

Channel assignment; Dynamic algorithm; Graph algorithms; L(2,1) labeling; Strong product

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER PROGRAM LISTINGS; TELECOMMUNICATION NETWORKS; TRANSMITTERS; WIRELESS TELECOMMUNICATION SYSTEMS;

EID: 15844409022     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.01.007     Document Type: Article
Times cited : (27)

References (12)
  • 1
    • 0037963009 scopus 로고    scopus 로고
    • Channel assignment with separation for interference avoidance in wireless networks
    • A.A. Bertossi, M.C. Pinotti, and R.B. Tan Channel assignment with separation for interference avoidance in wireless networks IEEE Trans. Parallel Distrib. Systems 14 2003 222 235
    • (2003) IEEE Trans. Parallel Distrib. Systems , vol.14 , pp. 222-235
    • Bertossi, A.A.1    Pinotti, M.C.2    Tan, R.B.3
  • 2
    • 0038580940 scopus 로고
    • Relating path coverings to vertex labellings with a condition at distance two
    • J.P. Georges, D.W. Mauro, and M.A. Whittlesey Relating path coverings to vertex labellings with a condition at distance two Discrete Math. 135 1994 103 111
    • (1994) Discrete Math. , vol.135 , pp. 103-111
    • Georges, J.P.1    Mauro, D.W.2    Whittlesey, M.A.3
  • 3
    • 0000801332 scopus 로고
    • Labelling graphs with a condition at distance two
    • J.R. Griggs, and R.K. Yeh Labelling graphs with a condition at distance two SIAM J. Discrete Math. 5 1992 586 595
    • (1992) SIAM J. Discrete Math. , vol.5 , pp. 586-595
    • Griggs, J.R.1    Yeh, R.K.2
  • 4
    • 0019213982 scopus 로고
    • Frequency assignment: Theory and application
    • W.K. Hale Frequency assignment: theory and application Proc. IEEE 68 1980 1497 1514
    • (1980) Proc. IEEE , vol.68 , pp. 1497-1514
    • Hale, W.K.1
  • 7
    • 8344223280 scopus 로고    scopus 로고
    • Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2,1)-colorings and independence numbers
    • S. Klavžar, and A. Vesel Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1) -colorings and independence numbers Discrete Appl. Math. 129 2003 449 460
    • (2003) Discrete Appl. Math. , vol.129 , pp. 449-460
    • Klavžar, S.1    Vesel, A.2
  • 9
    • 38249023260 scopus 로고
    • A randomized 3-colouring algorithm
    • A.D. Petford, and D.J.A. Welsh A randomized 3-colouring algorithm Discrete Math. 74 1989 253 261
    • (1989) Discrete Math. , vol.74 , pp. 253-261
    • Petford, A.D.1    Welsh, D.J.A.2
  • 10
    • 0029453747 scopus 로고
    • Analysis of the mean field annealing algorithm for graph colouring
    • J. Shawe-Taylor, and J. Žerovnik Analysis of the mean field annealing algorithm for graph colouring J. Artif. Neural Netw. 2 1995 329 340
    • (1995) J. Artif. Neural Netw. , vol.2 , pp. 329-340
    • Shawe-Taylor, J.1    Žerovnik, J.2
  • 12
    • 15844407624 scopus 로고    scopus 로고
    • ftp://bled.uni-mb.si/arhiv/Vesel/labels/


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