The Computational Complexity of the Parallel Knock-Out Problem (Q3525764)

From MaRDI portal
Revision as of 12:38, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
The Computational Complexity of the Parallel Knock-Out Problem
scientific article

    Statements

    title
    The Computational Complexity of the Parallel Knock-Out Problem (English)
    0 references
    DOI
    10.1007/11682462_26
    0 references
    author
    Matthew Johnson
    0 references
    Daniël Paulusma
    0 references
    Iain A. Stewart
    0 references
    Hajo J. Broersma
    0 references
    publication date
    18 September 2008
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    05C85
    0 references
    68R10
    0 references
    zbMATH DE Number
    5345273
    0 references
    zbMATH Keywords
    parallel knock-out
    0 references
    graphs
    0 references
    computational complexity
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3525764&oldid=27851780"
    Powered by MediaWiki