메뉴 건너뛰기




Volumn 349, Issue 1, 2005, Pages 40-51

The chromatic and clique numbers of random scaled sector graphs

Author keywords

Chromatic number; Clique number; Random geometric graphs; Random scaled sector graphs; Talagrand's inequality

Indexed keywords

COMPUTATIONAL GEOMETRY; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; OPTICAL COMMUNICATION; RANDOM PROCESSES; SENSORS;

EID: 27844477782     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.050     Document Type: Conference Paper
Times cited : (5)

References (9)
  • 1
    • 27444438367 scopus 로고    scopus 로고
    • Sensor networks: An overview
    • Department of Computer Science, University of California at Davis
    • V. Anand, A. Bharathidasas, Sensor networks: an overview, Technical Report, Department of Computer Science, University of California at Davis, 2002.
    • (2002) Technical Report
    • Anand, V.1    Bharathidasas, A.2
  • 5
    • 18844466142 scopus 로고    scopus 로고
    • A random graph model for optical networks of sensors
    • J. Díaz, J. Petit, and M.J. Serna A random graph model for optical networks of sensors IEEE Trans. Mobile Comput. 2 2003 143 154
    • (2003) IEEE Trans. Mobile Comput. , vol.2 , pp. 143-154
    • Díaz, J.1    Petit, J.2    Serna, M.J.3
  • 7
    • 0037282567 scopus 로고    scopus 로고
    • Random channel assignment in the plane
    • C. McDiarmid Random channel assignment in the plane Random Struct. Algorithms 22 2003 187 212
    • (2003) Random Struct. Algorithms , vol.22 , pp. 187-212
    • McDiarmid, C.1
  • 9


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