The Complexity of Perfect Packings in Dense Graphs (Q2988829)

From MaRDI portal
Revision as of 21:05, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
The Complexity of Perfect Packings in Dense Graphs
scientific article

    Statements

    title
    The Complexity of Perfect Packings in Dense Graphs (English)
    0 references
    author
    Jie Han
    0 references
    publication date
    19 May 2017
    0 references
    zbMATH Keywords
    perfect packing
    0 references
    computational complexity
    0 references
    absorbing method
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C70
    0 references
    68Q17
    0 references
    68Q25
    0 references
    zbMATH DE Number
    6721525
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2988829&oldid=15998693"
    Powered by MediaWiki