메뉴 건너뛰기




Volumn , Issue , 1988, Pages 252-257

Clustering algorithms based on minimum and maximum spanning trees

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; OPTIMIZATION;

EID: 85031281851     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73393.73419     Document Type: Conference Paper
Times cited : (118)

References (10)
  • 3
    • 0001773546 scopus 로고
    • On the complexity of clustering problems
    • R. Henn, B. Korte and W. Oletti, eds. Springer, Berlin
    • P. Brucker, On the Complexity of Clustering Problems, in R. Henn, B. Korte and W. Oletti, eds., Optimizing and Operations Research, Springer, Berlin, 1977.
    • (1977) Optimizing and Operations Research
    • Brucker, P.1
  • 7
    • 49049130359 scopus 로고
    • The NP-completeness column: An ongoing guide
    • D. S. Johnson, The NP-Completeness Column: An Ongoing Guide, Journal of Algorithms, 3, 1982, 182-195.
    • (1982) Journal of Algorithms , vol.3 , pp. 182-195
    • Johnson, D.S.1


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