FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Parameterized Algorithms for Directed Maximum Leaf Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Algorithms and Bounds for Directed Maximum Leaf Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Directed Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems without Polynomial Kernels (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the maximum leaf spanning arborescence problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of some Maximum Spanning Tree Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Finding Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Maximum Leaf Spanning Trees in Almost Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252040 / rank
 
Normal rank

Revision as of 10:44, 2 July 2024

scientific article
Language Label Description Also known as
English
FPT algorithms and kernels for the directed \(k\)-leaf problem
scientific article

    Statements

    FPT algorithms and kernels for the directed \(k\)-leaf problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 February 2010
    0 references
    out-branching subgraph
    0 references
    digraph
    0 references
    leaves
    0 references
    fixed-parameter tractable
    0 references
    kernel
    0 references
    directed max leaf problem
    0 references
    rooted directed k-leaf problem
    0 references

    Identifiers