Minimum Leaf Removal for Reconciliation: Complexity and Algorithms (Q2904513)

From MaRDI portal
Revision as of 21:44, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Minimum Leaf Removal for Reconciliation: Complexity and Algorithms
scientific article

    Statements

    title
    Minimum Leaf Removal for Reconciliation: Complexity and Algorithms (English)
    0 references
    author
    Riccardo Dondi
    0 references
    Nadia El-Mabrouk
    0 references
    publication date
    14 August 2012
    0 references
    Mathematics Subject Classification ID
    68Q17
    0 references
    05C05
    0 references
    05C85
    0 references
    92D15
    0 references
    zbMATH DE Number
    6065619
    0 references
    OpenAlex ID
    W97999600
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2904513&oldid=31817995"
    Powered by MediaWiki