Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree (Q3189028)

From MaRDI portal
Revision as of 22:47, 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
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
scientific article

    Statements

    Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree (English)
    0 references
    0 references
    0 references
    9 September 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    directed graphs
    0 references
    fixed parameter tractable
    0 references
    maximum leaf
    0 references
    0 references