Partitioning a graph into alliance free sets (Q1025928)

From MaRDI portal
Revision as of 13:33, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Partitioning a graph into alliance free sets
scientific article

    Statements

    title
    Partitioning a graph into alliance free sets (English)
    0 references
    author
    Khurram Shafique
    0 references
    Ronald D. Dutton
    0 references
    publication date
    23 June 2009
    0 references
    zbMATH Keywords
    alliance
    0 references
    defensive alliance
    0 references
    alliance-free set
    0 references
    alliance cover set
    0 references
    vertex partition
    0 references

    Identifiers

    zbMATH DE Number
    5569055
    0 references
    OpenAlex ID
    W2132985585
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1025928&oldid=38588822"
    Powered by MediaWiki