A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (Q281816)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
scientific article

    Statements

    A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 May 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    graph colouring
    0 references
    heuristic
    0 references
    bitwise operations
    0 references
    greedy algorithm
    0 references
    sequential colouring
    0 references
    0 references