Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Directed Maximum Leaf Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / 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: Solving Connected Dominating Set Faster Than 2 n / 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: 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: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval graphs and searching / 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

Latest revision as of 21:10, 27 June 2024

scientific article; zbMATH DE number 5267234
Language Label Description Also known as
English
Better Algorithms and Bounds for Directed Maximum Leaf Problems
scientific article; zbMATH DE number 5267234

    Statements

    Better Algorithms and Bounds for Directed Maximum Leaf Problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 April 2008
    0 references

    Identifiers