An exact algorithm for the maximum leaf spanning tree problem (Q653320)

From MaRDI portal
Revision as of 20:13, 4 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
An exact algorithm for the maximum leaf spanning tree problem
scientific article

    Statements

    title
    An exact algorithm for the maximum leaf spanning tree problem (English)
    0 references
    author
    Henning Fernau
    0 references
    Joachim Kneis
    0 references
    Dieter Kratsch
    0 references
    Alexander Langer
    0 references
    Mathieu Liedloff
    0 references
    Daniel Raible
    0 references
    Peter Rossmanith
    0 references
    publication date
    9 January 2012
    0 references
    Mathematics Subject Classification ID
    68W40
    0 references
    05C85
    0 references
    05C05
    0 references
    zbMATH DE Number
    5995822
    0 references
    zbMATH Keywords
    exponential time algorithms
    0 references
    graph algorithms
    0 references
    spanning tree
    0 references
    maximum leaf spanning tree
    0 references
    Wikidata QID
    Q59442095
    0 references
    OpenAlex ID
    W2180968341
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q653320&oldid=35261276"
    Powered by MediaWiki