Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089): 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.1007/978-3-540-87744-8_19 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1948989440 / rank | |||
Normal rank | |||
Revision as of 00:47, 20 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
25 November 2008
0 references
