Computing maximum \(k\)-defective cliques in massive graphs (Q2026994)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Computing maximum \(k\)-defective cliques in massive graphs
scientific article

    Statements

    Computing maximum \(k\)-defective cliques in massive graphs (English)
    0 references
    0 references
    21 May 2021
    0 references
    relaxed clique
    0 references
    exact search
    0 references
    branch-and-bound
    0 references
    massive graphs
    0 references
    graph reduction
    0 references
    0 references
    0 references

    Identifiers