Tight bounds and a fast FPT algorithm for directed MAX-leaf spanning tree (Q3189028)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6341902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bounds and a fast FPT algorithm for directed MAX-leaf spanning tree |
scientific article; zbMATH DE number 6341902 |
Statements
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree (English)
0 references
9 September 2014
0 references
directed graphs
0 references
fixed parameter tractable
0 references
maximum leaf
0 references
0.995419979095459
0 references
0.903988480567932
0 references
0.8973748087882996
0 references
0.8824779987335205
0 references
0.8683698773384094
0 references
