On Finding Directed Trees with Many Leaves (Q3656853): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q858107
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Steéphan Thomassé / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1615046544 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 0904.2658 / 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: Spanning Directed Trees with Many Leaves / 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: Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-stabilizing systems in spite of distributed control / 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: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / 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: A short note on the approximability of the maximum leaves spanning tree problem / 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: Q5596083 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rubber bands, convex embeddings and graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing full spanning trees for cubic graphs / rank
 
Normal rank

Latest revision as of 08:36, 2 July 2024

scientific article
Language Label Description Also known as
English
On Finding Directed Trees with Many Leaves
scientific article

    Statements

    On Finding Directed Trees with Many Leaves (English)
    0 references
    0 references
    0 references
    14 January 2010
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references