Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734)

From MaRDI portal
Revision as of 09:36, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
scientific article

    Statements

    Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 August 2011
    0 references
    graph algorithms
    0 references
    irredundance number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers