메뉴 건너뛰기




Volumn 39, Issue 2, 2012, Pages 283-290

Coloring large graphs based on independent set extraction

Author keywords

Graph coloring; Independent set; Memetic search; Preprocessing; Tabu search

Indexed keywords

GRAPH COLORINGS; INDEPENDENT SET; LARGE GRAPHS; MEMETIC; MEMETIC ALGORITHMS; PRE-PROCESSING METHOD; PREPROCESSING; TABU SEARCH ALGORITHMS;

EID: 79958163046     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.04.002     Document Type: Article
Times cited : (52)

References (32)
  • 2
    • 34548389659 scopus 로고    scopus 로고
    • A graph coloring heuristic using partial solutions and a reactive tabu scheme
    • DOI 10.1016/j.cor.2006.05.014, PII S0305054806001420
    • I. Blöchliger, and N. Zufferey A graph coloring heuristic using partial solutions and a reactive tabu scheme Computers and Operations Research 35 3 2008 960 975 (Pubitemid 47368857)
    • (2008) Computers and Operations Research , vol.35 , Issue.3 , pp. 960-975
    • Blochliger, I.1    Zufferey, N.2
  • 3
    • 33748960402 scopus 로고    scopus 로고
    • A graph-based hyper-heuristic for educational timetabling problems
    • DOI 10.1016/j.ejor.2005.08.012, PII S0377221705006387
    • E.K. Burke, B. McCollum, A. Meisels, S. Petrovic, and R. Qu A graph-based hyper heuristic for timetabling problems European Journal of Operational Research 176 2007 177 192 (Pubitemid 44442718)
    • (2007) European Journal of Operational Research , vol.176 , Issue.1 , pp. 177-192
    • Burke, E.K.1    McCollum, B.2    Meisels, A.3    Petrovic, S.4    Qu, R.5
  • 4
    • 0023452952 scopus 로고
    • Some experiments with simulated annealing for coloring graphs
    • M. Chams, A. Hertz, and D. de Werra Some experiments with simulated annealing for coloring graphs European Journal of Operational Research 32 1987 260 266 (Pubitemid 18516642)
    • (1987) European Journal of Operational Research , vol.32 , Issue.2 , pp. 260-266
    • Chams, M.1    Hertz, A.2    De Werra, D.3
  • 6
    • 0029362459 scopus 로고
    • Embedding of a sequential procedure within an evolutionary algorithm for coloring problem in graphs
    • D. Costa, A. Hertz, and O. Dubuis Embedding of a sequential procedure within an evolutionary algorithm for coloring problem in graphs Journal of Heuristics 1 1995 105 128
    • (1995) Journal of Heuristics , vol.1 , pp. 105-128
    • Costa, D.1    Hertz, A.2    Dubuis, O.3
  • 7
    • 0006632542 scopus 로고    scopus 로고
    • On a graph-theoretical model for cyclic register allocation
    • PII S0166218X99001055
    • D. de Werra, C. Eisenbeis, S. Lelait, and B. Marmol On a graph-theoretical model for cyclic register allocation Discrete Applied Mathematics 93 23 1999 191 203 (Pubitemid 129562987)
    • (1999) Discrete Applied Mathematics , vol.93 , Issue.2-3 , pp. 191-203
    • De Werra, D.1    Eisenbeis, Ch.2    Lelait, S.3    Marmol, B.4
  • 8
    • 84878602368 scopus 로고    scopus 로고
    • A New Genetic Local Search Algorithm for Graph Coloring
    • Parallel Problems Solving from Nature - PPSN V
    • R. Dorne, and J.K. Hao A new genetic local search algorithm for graph coloring Lecture notes in computer science vol. 1498 1998 745 754 (Pubitemid 128146004)
    • (1998) Lecture Notes in Computer Science , Issue.1498 , pp. 745-754
    • Dorne, R.1    Hao, J.-K.2
  • 9
    • 27844522089 scopus 로고    scopus 로고
    • Genetic and hybrid algorithms for graph coloring
    • C. Fleurent, and J.A. Ferland Genetic and hybrid algorithms for graph coloring Annals of Operations Research 63 1996 437 461 (Pubitemid 126729251)
    • (1996) Annals of Operations Research , vol.63 , pp. 437-461
    • Fleurent, C.1    Ferland, J.A.2
  • 10
    • 0034225034 scopus 로고    scopus 로고
    • A minimal-state processing search algorithm for graph coloring problems
    • N. Funabiki, and T. Higashino A minimal-state processing search algorithm for graph coloring problems IEICE Transaction Fundamentals E83-A 2000 1420 1430
    • (2000) IEICE Transaction Fundamentals , vol.83 , pp. 1420-1430
    • Funabiki, N.1    Higashino, T.2
  • 11
    • 0000965650 scopus 로고    scopus 로고
    • Hybrid Evolutionary Algorithms for Graph Coloring
    • P. Galinier, and J.K. Hao Hybrid evolutionary algorithms for graph coloring Journal of Combinatorial Optimization 3 4 1999 379 397 (Pubitemid 129575323)
    • (1999) Journal of Combinatorial Optimization , vol.3 , Issue.4 , pp. 379-397
    • Galinier, P.1    Hao, J.-K.2
  • 12
    • 30744459905 scopus 로고    scopus 로고
    • A survey of local search methods for graph coloring
    • DOI 10.1016/j.cor.2005.07.028, PII S0305054805002315, Computers Operations on Tabu Search
    • P. Galinier, and A. Hertz A survey of local search methods for graph coloring Computers and Operations Research 33 9 2006 2547 2562 (Pubitemid 43098900)
    • (2006) Computers and Operations Research , vol.33 , Issue.9 , pp. 2547-2562
    • Galinier, P.1    Hertz, A.2
  • 13
    • 37049006713 scopus 로고    scopus 로고
    • An adaptive memory algorithm for the k-coloring problem
    • DOI 10.1016/j.dam.2006.07.017, PII S0166218X07001114, Computational Methods for Graph Coloring and it's Generalization
    • P. Galinier, A. Hertz, and N. Zufferey An adaptive memory algorithm for the K-colouring problem Discrete Applied Mathematics 156 2 2008 267 279 (Pubitemid 350251597)
    • (2008) Discrete Applied Mathematics , vol.156 , Issue.2 , pp. 267-279
    • Galinier, P.1    Hertz, A.2    Zufferey, N.3
  • 14
    • 33846054009 scopus 로고    scopus 로고
    • A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
    • DOI 10.1016/j.cor.2005.09.010, PII S030505480500300X
    • M. Gamache, A. Hertz, and J.O. Ouellet A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding Computers and Operations Research 34 8 2007 2384 2395 (Pubitemid 46073429)
    • (2007) Computers and Operations Research , vol.34 , Issue.8 , pp. 2384-2395
    • Gamache, M.1    Hertz, A.2    Ouellet, J.O.3
  • 17
    • 84959045917 scopus 로고    scopus 로고
    • Scatter search for graph coloring
    • Springer-Verlag
    • J.P. Hamiez, and J.K. Hao Scatter search for graph coloring Lecture notes in computer science vol. 2310 2002 Springer-Verlag 168 179
    • (2002) Lecture Notes in Computer Science , vol.2310 , pp. 168-179
    • Hamiez, J.P.1    Hao, J.K.2
  • 18
    • 0023596413 scopus 로고
    • Using tabu search techniques for graph coloring
    • A. Hertz, and D. de Werra Using tabu search techniques for graph coloring Computing 39 1987 345 351 (Pubitemid 18562739)
    • (1987) Computing (Vienna/New York) , vol.39 , Issue.4 , pp. 345-351
    • Hertz, A.1    De Werra, D.2
  • 20
    • 0001047763 scopus 로고
    • Optimization by simulated annealing: An experimental evaluation, part II, graph coloring and number partitioning
    • D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon Optimization by simulated annealing: an experimental evaluation, part II, graph coloring and number partitioning Operations Research 39 3 1991 378 406
    • (1991) Operations Research , vol.39 , Issue.3 , pp. 378-406
    • Johnson, D.S.1    Aragon, C.R.2    McGeoch, L.A.3    Schevon, C.4
  • 21
    • 0011620023 scopus 로고    scopus 로고
    • Cliques, coloring, and satisfiability: Second dimacs implementation challenge
    • American Mathematical Society
    • Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability: second dimacs implementation challenge. DIMACS series in discrete mathematics and theoretical computer science, vol. 26. American Mathematical Society; 1996.
    • (1996) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.26
    • Johnson, D.S.1    Ma, T.2
  • 22
    • 0035397913 scopus 로고    scopus 로고
    • A GRASP for coloring sparse graphs
    • DOI 10.1023/A:1011237503342
    • M. Laguna, and R. Martí A GRASP for coloring sparse graphs Computational Optimization and Applications 19 2 2001 165 178 (Pubitemid 32585286)
    • (2001) Computational Optimization and Applications , vol.19 , Issue.2 , pp. 165-178
    • Laguna, M.1    Marti, R.2
  • 24
    • 61349113300 scopus 로고    scopus 로고
    • A metaheuristic approach for the vertex coloring problem
    • E. Malaguti, M. Monaci, and P. Toth A metaheuristic approach for the vertex coloring problem INFORMS Journal on Computing 20 2 2008 302 316
    • (2008) INFORMS Journal on Computing , vol.20 , Issue.2 , pp. 302-316
    • Malaguti, E.1    Monaci, M.2    Toth, P.3
  • 25
    • 0000243782 scopus 로고    scopus 로고
    • Distributed coloration neighborhood search
    • Johnson DS, Trick MA, editors DIMACS series in discrete mathematics and theoretical computer science American Mathematical Society
    • Morgenstern C. Distributed coloration neighborhood search. In: Johnson DS, Trick MA, editors. Cliques, coloring, and satisfiability: second dimacs implementation challenge. DIMACS series in discrete mathematics and theoretical computer science, vol. 26. American Mathematical Society; 1996. p. 3357.
    • (1996) Cliques, Coloring, and Satisfiability: Second Dimacs Implementation Challenge , vol.26 , pp. 335-337
    • Morgenstern, C.1
  • 26
    • 84867997005 scopus 로고    scopus 로고
    • A fast algorithm for the maximum clique problem
    • P.R. Östergard A fast algorithm for the maximum clique problem Discrete Applied Mathematics 120 13 2002 197 207
    • (2002) Discrete Applied Mathematics , vol.120 , Issue.13 , pp. 197-207
    • Östergard, P.R.1
  • 27
    • 70350776698 scopus 로고    scopus 로고
    • A search space cartography for guiding graph coloring heuristics
    • D.C. Porumbel, J.K. Hao, and P. Kuntz A search space cartography for guiding graph coloring heuristics Computers and Operations Research 37 4 2010 769 778
    • (2010) Computers and Operations Research , vol.37 , Issue.4 , pp. 769-778
    • Porumbel, D.C.1    Hao, J.K.2    Kuntz, P.3
  • 28
    • 77649190616 scopus 로고    scopus 로고
    • An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
    • D.C. Porumbel, J.K. Hao, and P. Kuntz An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring Computers and Operations Research 37 10 2010 1822 1832
    • (2010) Computers and Operations Research , vol.37 , Issue.10 , pp. 1822-1832
    • Porumbel, D.C.1    Hao, J.K.2    Kuntz, P.3
  • 30
    • 0032070963 scopus 로고    scopus 로고
    • Improving heuristics for the frequency assignment problem
    • PII S0377221797002233
    • D.H. Smith, S. Hurley, and S.U. Thiel Improving heuristics for the frequency assignment problem European Journal of Operational Research 107 1 1998 76 86 (Pubitemid 128391329)
    • (1998) European Journal of Operational Research , vol.107 , Issue.1 , pp. 76-86
    • Smith, D.H.1    Hurley, S.2    Thiel, S.U.3
  • 31
    • 49549117787 scopus 로고    scopus 로고
    • Graph colouring approaches for a satellite range scheduling problem
    • N. Zufferey, P. Amstutz, and P. Giaccari Graph colouring approaches for a satellite range scheduling problem Journal of Scheduling 11 4 2008 263 277
    • (2008) Journal of Scheduling , vol.11 , Issue.4 , pp. 263-277
    • Zufferey, N.1    Amstutz, P.2    Giaccari, P.3
  • 32


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