메뉴 건너뛰기




Volumn 33, Issue 3-4, 1990, Pages 209-216

A global optimization approach for solving the maximum clique problem

Author keywords

Global optimization; maximum clique problem

Indexed keywords


EID: 0000110396     PISSN: 00207160     EISSN: 10290265     Source Type: Journal    
DOI: 10.1080/00207169008803851     Document Type: Article
Times cited : (59)

References (12)
  • 1
    • 4944219893 scopus 로고
    • Upper bounds on the order of a clique of a graph
    • A. T. Amin and S. L. Hakimi, Upper bounds on the order of a clique of a graph, SIAM Journal of Applied Mathematics 22, No. 4 (1972), 569–573.
    • (1972) SIAM Journal of Applied Mathematics , vol.22 , Issue.4 , pp. 569-573
    • Amin, A.T.1    Hakimi, S.L.2
  • 2
    • 0022808049 scopus 로고
    • Finding the maximum clique in an arbitrary graph
    • E. Balas and C. S. Yu, Finding the maximum clique in an arbitrary graph, SIAM Journal on Computing 15, No. 4 (1986), 1054–1068.
    • (1986) SIAM Journal on Computing , vol.15 , Issue.4 , pp. 1054-1068
    • Balas, E.1    Yu, C.S.2
  • 3
    • 84976668743 scopus 로고
    • Finding all cliques of an undirected graph Communications of the ACM
    • C. Bron and J. Kerbosch, Finding all cliques of an undirected graph, Communications of the ACM 16, No. 9 (1973), 575–-577.
    • (1973) , vol.16 , Issue.9 , pp. 575-577
    • Bron, C.1    Kerbosch, J.2
  • 4
    • 0018321324 scopus 로고
    • Clique detection for nondirected graphs: Two new algorithms
    • L. Gerhards and W. Lindenberg, Clique detection for nondirected graphs: Two new algorithms, Computing 21, No. 4 (1979), 295–322.
    • (1979) Computing , vol.21 , Issue.4 , pp. 295-322
    • Gerhards, L.1    Lindenberg, W.2
  • 5
    • 84954822482 scopus 로고
    • Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York
    • M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, 1979.
    • (1979)
    • Garey, M.R.1    Johnson, D.S.2
  • 6
    • 84954647112 scopus 로고
    • Active constraints in optimization. Department of Mathematics. The Pennsylvania State University University Park, PA
    • W. W. Hager, P. M. Pardalos, I. M. Roussos and H. D. Sahinoglou, Active constraints in optimization. Department of Mathematics. The Pennsylvania State University, University Park, PA, 1987.
    • (1987)
    • Hager, W.W.1    Pardalos, P.M.2    Roussos, I.M.3    Sahinoglou, H.D.4
  • 7
  • 8
    • 0000230999 scopus 로고
    • Maxima for graphs and a new proof of a theorem of Turán
    • T. S. Motzkin and E. G. Straus, Maxima for graphs and a new proof of a theorem of Turán, Canadian Journal of Mathematics 17, No. 4 (1965), 533–540.
    • (1965) Canadian Journal of Mathematics , vol.17 , Issue.4 , pp. 533-540
    • Motzkin, T.S.1    Straus, E.G.2
  • 9
    • 84954836218 scopus 로고
    • A branch and bound algorithm for the maximum clique problem. Department of Computer Science The Pennsylvania State University, University Park, PA
    • P. M. Pardalos and G. P. Rodgers, A branch and bound algorithm for the maximum clique problem. Department of Computer Science, The Pennsylvania State University, University Park, PA, 1988.
    • (1988)
    • Pardalos, P.M.1    Rodgers, G.P.2
  • 10
    • 84954854238 scopus 로고
    • Constrained global optimization: Algorithms and applications Lecture Notes in Computer Science 268 G. Goos and J. Hartmanis (Ed.) Springer-Verlag, Berlin
    • P. M. Pardalos and J. B. Rosen, Constrained global optimization: Algorithms and applications, Lecture Notes in Computer Science 268, G. Goos and J. Hartmanis (Ed.), Springer-Verlag, Berlin, 1987.
    • (1987)
    • Pardalos, P.M.1    Rosen, J.B.2
  • 11
    • 84954853621 scopus 로고
    • Parallel algorithms for constrained optimization. Ph.D. Dissertation University of Minnesota, Minneapolis, MN
    • A. T. Phillips, Parallel algorithms for constrained optimization. Ph.D. Dissertation, University of Minnesota, Minneapolis, MN, 1988.
    • (1988)
    • Phillips, A.T.1


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