The binary identification problem for weighted trees (Q1758172)

From MaRDI portal
Revision as of 21:09, 5 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The binary identification problem for weighted trees
scientific article

    Statements

    title
    The binary identification problem for weighted trees (English)
    0 references
    author
    Ferdinando Cicalese
    0 references
    Tobias Jacobs
    0 references
    Caio Valentim
    0 references
    Eduardo Sany Laber
    0 references
    publication date
    8 November 2012
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q15
    0 references
    05C05
    0 references
    05C22
    0 references
    90C39
    0 references
    zbMATH DE Number
    6103626
    0 references
    zbMATH Keywords
    binary identification problem
    0 references
    weighted trees
    0 references
    minimum cost strategy
    0 references
    decision tree
    0 references
    computational complexity
    0 references
    NP-hard
    0 references
    OpenAlex ID
    W2004158059
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1758172&oldid=35306534"
    Powered by MediaWiki