Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree (Q3189028): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/2000807.2000812 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1993219112 / rank | |||
Normal rank | |||
Latest revision as of 21:47, 19 March 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
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
