Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (Q1926502)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem
scientific article

    Statements

    Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (English)
    0 references
    0 references
    0 references
    28 December 2012
    0 references
    0 references
    maximum clique
    0 references
    clique partition
    0 references
    approximation algorithm
    0 references
    0 references