A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.cor.2011.10.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1991496278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring approaches for a satellite range scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding / 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: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715148 / 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: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / 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 graph coloring heuristic using partial solutions and a reactive tabu scheme / 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: A branch-and-cut algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for the vertex coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe Lower Bounds for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic Scheduling and the Chromatic Number Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact bit-parallel algorithm for the maximum clique problem / rank
 
Normal rank

Latest revision as of 22:09, 5 July 2024

scientific article
Language Label Description Also known as
English
A new \textsf{DSATUR}-based algorithm for exact vertex coloring
scientific article

    Statements

    A new \textsf{DSATUR}-based algorithm for exact vertex coloring (English)
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    color
    0 references
    graph
    0 references
    exact
    0 references
    DSATUR
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references