The Complexity of Graph Pebbling (Q5757392)

From MaRDI portal
Revision as of 03:05, 20 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5188078
Language Label Description Also known as
English
The Complexity of Graph Pebbling
scientific article; zbMATH DE number 5188078

    Statements

    title
    The Complexity of Graph Pebbling (English)
    0 references
    author
    Kevin G. Milans
    0 references
    Bryan K. Clark
    0 references
    publication date
    6 September 2007
    0 references
    zbMATH Keywords
    graph pebbling
    0 references
    complexity
    0 references
    \({\Pi_2^{\mathrm{p}}}\)-completeness
    0 references

    Identifiers

    DOI
    10.1137/050636218
    0 references
    Mathematics Subject Classification ID
    05C99
    0 references
    68Q17
    0 references
    68R10
    0 references
    zbMATH DE Number
    5188078
    0 references
    OpenAlex ID
    W2033611584
    0 references
    arXiv ID
    math/0503698
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5757392&oldid=33771128"
    Powered by MediaWiki