Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks (Q2942692)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
scientific article

    Statements

    Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks (English)
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references
    maximum clique
    0 references
    vertex coloring
    0 references
    very-large-scale networks
    0 references
    exact algorithm
    0 references
    \(k\)-community
    0 references
    \(k\)-core
    0 references
    clique relaxation
    0 references
    scale reduction
    0 references

    Identifiers