메뉴 건너뛰기




Volumn , Issue , 1992, Pages 71-74

On the complexity of distance-2 coloring

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COLORING; GRAPHIC METHODS;

EID: 85053972651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCI.1992.227702     Document Type: Conference Paper
Times cited : (62)

References (10)
  • 1
    • 0022307813 scopus 로고
    • A link allocation protocol for mobile multi-hop radio networks
    • Dec.
    • [CL85] I. Chlamtac and S. Lerner. A link allocation protocol for mobile multi-hop radio networks. In Proc. Globecom, Dec. 1985.
    • (1985) Proc. Globecom
    • Chlamtac, I.1    Lerner, S.2
  • 2
    • 0023842986 scopus 로고
    • A distributed algorithm for efficient and interference free broadcasting in radio networks
    • [ET88] A. Ephremedis and T. Truong. A distributed algorithm for efficient and interference free broadcasting in radio networks. In Proceedings of the INFOCOM, 1988.
    • (1988) Proceedings of the INFOCOM
    • Ephremedis, A.1    Truong, T.2
  • 4
    • 9644299374 scopus 로고
    • The NP-completeness column: An ongoing guide
    • jun
    • [Joh82] D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, jun 1982.
    • (1982) Journal of Algorithms
    • Johnson, D.S.1
  • 7
    • 0000185938 scopus 로고
    • Edge-disjoint spanning trees of finite graphs
    • [NW61] C. St. J. A. Nash-Williams. Edge-disjoint spanning trees of finite graphs. J. London Math. Soc., 36, pages 213-228, 1961.
    • (1961) J. London Math. Soc. , vol.36 , pp. 213-228
    • St. Nash-Williams, C.J.A.1
  • 10
    • 0024860918 scopus 로고
    • Distributed scheduling of broadcasts in a radio network
    • [RP89] R. Ramaswami and K. K. Parhi. Distributed scheduling of broadcasts in a radio network. In Proceedings of the INFOCOM, 1989.
    • (1989) Proceedings of the INFOCOM
    • Ramaswami, R.1    Parhi, K.K.2


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