메뉴 건너뛰기




Volumn 2368, Issue , 2002, Pages 230-239

Improved algorithms for the random cluster graph model

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; PROBABILITY;

EID: 23044533396     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_24     Document Type: Conference Paper
Times cited : (10)

References (11)
  • 4
    • 0000182415 scopus 로고
    • A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations
    • H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statis., 23:493–507, 1952.
    • (1952) Ann. Math. Statis , vol.23 , pp. 493-507
    • Chernoff, H.1
  • 6
    • 0002706976 scopus 로고
    • The solution of some random NP-hard problems in polynomial expected time
    • M. E. Dyer and A. M. Frieze. The solution of some random NP-hard problems in polynomial expected time. J. of Algorithms, 10(4):451–489, 1989.
    • (1989) J. Of Algorithms , vol.10 , Issue.4 , pp. 451-489
    • Dyer, M.E.1    Frieze, A.M.2


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