The complexity of bicriteria tree-depth (Q5918682)

From MaRDI portal
Revision as of 02:11, 29 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7530227
Language Label Description Also known as
English
The complexity of bicriteria tree-depth
scientific article; zbMATH DE number 7530227

    Statements

    title
    The complexity of bicriteria tree-depth (English)
    0 references
    author
    Piotr Borowiecki
    0 references
    Dariusz Dereniowski
    0 references
    Dorota Osula
    0 references
    publication date
    20 May 2022
    0 references
    zbMATH DE Number
    7530227
    0 references
    zbMATH Keywords
    elimination tree
    0 references
    graph ranking
    0 references
    parallel assembly
    0 references
    tree-depth
    0 references
    OpenAlex ID
    W3199254404
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5918682&oldid=36807416"
    Powered by MediaWiki