CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321)

From MaRDI portal
scientific article; zbMATH DE number 7709061
Language Label Description Also known as
English
CliSAT: a new exact algorithm for hard maximum clique problems
scientific article; zbMATH DE number 7709061

    Statements

    CliSAT: a new exact algorithm for hard maximum clique problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 July 2023
    0 references
    0 references
    combinatorial optimization
    0 references
    exact algorithm
    0 references
    branch-and-bound algorithm
    0 references
    maximum clique problem
    0 references
    0 references
    0 references
    0 references
    0 references