The Complexity of Graph Pebbling (Q5757392): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Importer (talk | contribs)
Changed an Item
 
Property / arXiv ID
 
Property / arXiv ID: math/0503698 / rank
 
Normal rank

Latest revision as of 03:05, 20 April 2024

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

    The Complexity of Graph Pebbling (English)
    0 references
    0 references
    0 references
    6 September 2007
    0 references
    graph pebbling
    0 references
    complexity
    0 references
    \({\Pi_2^{\mathrm{p}}}\)-completeness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references