Improving the extraction and expansion method for large graph coloring (Q714028): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: EXTRACOL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.06.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064850189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search for graph coloring. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ant-based algorithm for coloring graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-based hyper-heuristic for educational timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding a novel objective function in a two-phased local search for robust vertex coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some experiments with simulated annealing for coloring graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook of Approximation Algorithms and Metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ants can colour graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph-theoretical model for cyclic register allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic and hybrid algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of local search methods for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive memory algorithm for the \(k\)-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of graph coloring to printed circuit testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bag rationalisation for a food manufacturer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687259 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736905 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable space search for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive tabu search for course timetabling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Metaheuristic Approach for the Vertex Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant Local Search and its efficient adaptation to graph colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search space ``cartography'' for guiding graph coloring heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for computing the distance between close partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving heuristics for the frequency assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum annealing of the graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the extraction and expansion method for large graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring large graphs based on independent set extraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph coloring by multiagent fusion search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by ant algorithms: possible roles for an individual ant / rank
 
Normal rank

Latest revision as of 19:43, 5 July 2024

scientific article
Language Label Description Also known as
English
Improving the extraction and expansion method for large graph coloring
scientific article

    Statements

    Improving the extraction and expansion method for large graph coloring (English)
    0 references
    0 references
    0 references
    19 October 2012
    0 references
    0 references
    graph coloring
    0 references
    graph \(k\)-coloring
    0 references
    independent set extraction
    0 references
    memetic coloring
    0 references
    progressive optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references