Bandwidth and pebbling (Q1838912)

From MaRDI portal
Revision as of 08:39, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Bandwidth and pebbling
scientific article

    Statements

    title
    Bandwidth and pebbling (English)
    0 references
    author
    Ivan Hal Sudborough
    0 references
    Arnold L. Rosenberg
    0 references
    published in
    Computing
    0 references
    publication date
    1983
    0 references
    zbMATH Keywords
    bandwidth of a graph
    0 references
    computational pebble game
    0 references
    directed acyclic graphs
    0 references
    breadth-first pebble game
    0 references
    undirected graphs
    0 references
    games on graphs
    0 references
    NP- completeness
    0 references

    Identifiers

    DOI
    10.1007/BF02259908
    0 references
    zbMATH DE Number
    3805314
    0 references
    OpenAlex ID
    W177441241
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1838912&oldid=36922860"
    Powered by MediaWiki