메뉴 건너뛰기




Volumn 14, Issue 3, 1999, Pages 367-381

Augmentation algorithm for the maximum weighted stable set problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; PROBLEM SOLVING; SET THEORY; STATISTICAL METHODS;

EID: 0032595816     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1026456624746     Document Type: Article
Times cited : (18)

References (30)
  • 1
    • 0025904136 scopus 로고
    • Finding maximum cliques in arbitrary and special graphs
    • L. Babel, "Finding maximum cliques in arbitrary and special graphs," Computing, vol. 46, no. 4, pp. 321-341, 1991.
    • (1991) Computing , vol.46 , Issue.4 , pp. 321-341
    • Babel, L.1
  • 2
    • 0028730104 scopus 로고
    • A fast algorithm for the maximum weight clique problem
    • L. Babel, "A fast algorithm for the maximum weight clique problem," Computing, vol. 52, pp. 31-38, 1994.
    • (1994) Computing , vol.52 , pp. 31-38
    • Babel, L.1
  • 4
    • 0003365840 scopus 로고    scopus 로고
    • Finding large clique in arbitrary graphs by bipartite matching
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society
    • E. Balas and W. Niehaus, "Finding large clique in arbitrary graphs by bipartite matching," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 29-51, American Mathematical Society, 1996.
    • (1996) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 29-51
    • Balas, E.1    Niehaus, W.2
  • 5
    • 0026135666 scopus 로고
    • Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs
    • E. Balas and J. Xue, "Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs," SIAM Journal on Computing, vol. 20, pp. 209-221, 1991.
    • (1991) SIAM Journal on Computing , vol.20 , pp. 209-221
    • Balas, E.1    Xue, J.2
  • 6
    • 0000781165 scopus 로고    scopus 로고
    • Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
    • E. Balas and J. Xue, "Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring." Algorithmica, vol. 15, pp. 397-412, 1996.
    • (1996) Algorithmica , vol.15 , pp. 397-412
    • Balas, E.1    Xue, J.2
  • 7
    • 0022808049 scopus 로고
    • Finding a maximum clique in an arbitrary graph
    • E. Balas and C.S. Yu, "Finding a maximum clique in an arbitrary graph," SIAM Journal on Computing, vol. 15, pp. 1054-1068, 1986.
    • (1986) SIAM Journal on Computing , vol.15 , pp. 1054-1068
    • Balas, E.1    Yu, C.S.2
  • 9
    • 0042770128 scopus 로고
    • A combinatorial column generation algorithm for the maximum clique and stable set problem
    • Les Cahiers du GERD, July
    • J. Bourjolly, G. Laporte, and H. Mercure, "A combinatorial column generation algorithm for the maximum clique and stable set problem," Technical Report G-94-33, Les Cahiers du GERD, July 1994.
    • (1994) Technical Report G-94-33
    • Bourjolly, J.1    Laporte, G.2    Mercure, H.3
  • 10
    • 0011628892 scopus 로고    scopus 로고
    • Camuflating independent sets in quasi-random graphs
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society
    • M. Brockington and J.C. Culberson, "Camuflating independent sets in quasi-random graphs," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 221-242, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 221-242
    • Brockington, M.1    Culberson, J.C.2
  • 11
    • 0025521978 scopus 로고
    • An exact algorithm for the maximum clique problem
    • R. Carraghan and P.M. Pardalos, "An exact algorithm for the maximum clique problem," Operations Research Letters, vol. 9, pp. 375-382, 1990.
    • (1990) Operations Research Letters , vol.9 , pp. 375-382
    • Carraghan, R.1    Pardalos, P.M.2
  • 12
    • 0001931981 scopus 로고
    • Stabulus: A technique for finding stable sets in large graphs with tabu search
    • C. Friden, A. Hertz, and D. de Werra, "Stabulus: a technique for finding stable sets in large graphs with tabu search," Computing, vol. 42, pp. 35-45, 1989.
    • (1989) Computing , vol.42 , pp. 35-45
    • Friden, C.1    Hertz, A.2    De Werra, D.3
  • 13
    • 0025541550 scopus 로고
    • An exact algoritithm based on tabu search for finding a maximum independent set in graph
    • C. Friden, A. Hertz, and D. de Werra, "An exact algoritithm based on tabu search for finding a maximum independent set in graph," Computers Opns. Res., vol. 17, no. 5, pp. 375-382, 1990.
    • (1990) Computers Opns. Res. , vol.17 , Issue.5 , pp. 375-382
    • Friden, C.1    Hertz, A.2    De Werra, D.3
  • 15
    • 0000370080 scopus 로고    scopus 로고
    • Tabu search algorithms for the maximum clique problem
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M. A. Trick (Eds.), American Mathematical Society
    • M. Gendrau and P. Soriano, "Tabu search algorithms for the maximum clique problem," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M. A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 221-242, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 221-242
    • Gendrau, M.1    Soriano, P.2
  • 16
    • 0000489013 scopus 로고    scopus 로고
    • A continuous based heuristic for the maximum clique problem
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M. A. Trick (Eds.), American Mathematical Society
    • L.E. Gibbons, D.W. Hearn, and P.M. Pardalos, "A continuous based heuristic for the maximum clique problem," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M. A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 103-124, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 103-124
    • Gibbons, L.E.1    Hearn, D.W.2    Pardalos, P.M.3
  • 17
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover, "Future paths for integer programming and links to artificial intelligence," Computers Opns. Res., vol. 13, pp. 533-549, 1986.
    • (1986) Computers Opns. Res. , vol.13 , pp. 533-549
    • Glover, F.1
  • 18
    • 0003363811 scopus 로고    scopus 로고
    • Constructing cliques using restricted backtracking
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society
    • M.K. Goldberg and R.D. Rivenburgh, "Constructing cliques using restricted backtracking," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 285-307, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 285-307
    • Goldberg, M.K.1    Rivenburgh, R.D.2
  • 19
    • 0001575117 scopus 로고    scopus 로고
    • Applying the inn model to the max clique problem
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society
    • T. Grossman, "Applying the inn model to the max clique problem," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 125-145, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 125-145
    • Grossman, T.1
  • 20
    • 0001217319 scopus 로고    scopus 로고
    • Experiments with polynomial-time clique approximation algorithms on very large graphs
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society
    • S. Homer and M. Peinado, "Experiments with polynomial-time clique approximation algorithms on very large graphs," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 147-167, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 147-167
    • Homer, S.1    Peinado, M.2
  • 21
    • 0002440365 scopus 로고    scopus 로고
    • Approximately solving maximum clique using neural network and related heuristic
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society
    • A. Jagota, L. Sanchis, and R. Ganesan, "Approximately solving maximum clique using neural network and related heuristic," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M.A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 169-204, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 169-204
    • Jagota, A.1    Sanchis, L.2    Ganesan, R.3
  • 24
    • 0003351541 scopus 로고    scopus 로고
    • Edge projection and the maximum stable set problem
    • Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M. A. Trick (Eds.), American Mathematical Society
    • C. Mannino and A. Sassano, "Edge projection and the maximum stable set problem," in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, D.S. Johnson and M. A. Trick (Eds.), Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 205-219, American Mathematical Society, 1996.
    • (1996) Discrete Mathematics and Theoretical Computer Science , vol.26 , pp. 205-219
    • Mannino, C.1    Sassano, A.2
  • 25
    • 84974861933 scopus 로고
    • A strong cutting plane/branch-and-bound algorithm for node packing
    • G.L. Nemhauser and G. Sigismondi, "A strong cutting plane/branch-and-bound algorithm for node packing," J. Ops. Res. Soc., vol. 43, no. 5, pp. 443-457, 1992.
    • (1992) J. Ops. Res. Soc. , vol.43 , Issue.5 , pp. 443-457
    • Nemhauser And, G.L.1    Sigismondi, G.2
  • 26
    • 0345007967 scopus 로고
    • Master's Thesis, Dipartimento di Matematica, Facoltà di Scienze Matematiche, Fisiche e Naturali, Via della Ricerca Scientifica, 00133 Rome, Italy
    • L. Orlandani, "Algoritmi di ricerca tabu per il problema del maxclique," Master's Thesis, Dipartimento di Matematica, Facoltà di Scienze Matematiche, Fisiche e Naturali, Via della Ricerca Scientifica, 00133 Rome, Italy, 1994.
    • (1994) Algoritmi di Ricerca Tabu per il Problema del Maxclique
    • Orlandani, L.1
  • 27
    • 0038579896 scopus 로고
    • The maximum clique problem
    • P. Pardalos and J. Xue, "The maximum clique problem," J. of Global Optimization, vol. 4, no. 3, pp. 286-301, 1994.
    • (1994) J. of Global Optimization , vol.4 , Issue.3 , pp. 286-301
    • Pardalos, P.1    Xue, J.2
  • 28
    • 0344145554 scopus 로고
    • A branch and bound algorithm for the stability number of a sparse graph
    • May to appear
    • E.C. Sewell, "A branch and bound algorithm for the stability number of a sparse graph," INFORMS J. on Comp., May 1995, to appear.
    • (1995) INFORMS J. on Comp.
    • Sewell, E.C.1
  • 29
    • 38249007475 scopus 로고
    • Stability number of bull and chair-free graphs
    • C. De Simone and A. Sassano, "Stability number of bull and chair-free graphs," Discrete Applied Mathematics, vol. 41, pp. 121-129, 1993.
    • (1993) Discrete Applied Mathematics , vol.41 , pp. 121-129
    • De Simone, C.1    Sassano, A.2
  • 30
    • 0345439104 scopus 로고
    • Ph.D. Thesis, Graduate School of Industrial Administration, Carnegie Mellon University, April
    • Jue Xue, "Fast algorithms for the vertex packing problem," Ph.D. Thesis, Graduate School of Industrial Administration, Carnegie Mellon University, April 1991.
    • (1991) Fast Algorithms for the Vertex Packing Problem
    • Xue, J.1


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