Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_19 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1948989440 / 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: Parameterized Algorithms for Directed Maximum Leaf Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / 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 in Graphs without Diamonds and Blossoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with many leaves / 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: Minimum Leaf Out-Branching Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252040 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:09, 28 June 2024

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