Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213)

From MaRDI portal
Revision as of 00:29, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
scientific article
Language Label Description Also known as
English
Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs
scientific article

    Statements

    Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    maximum clique
    0 references
    degeneracy
    0 references
    sparse graphs
    0 references
    fixed-parameter
    0 references
    tractability
    0 references
    \(d\)-degenerate graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references