Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3525559): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user 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-74456-6_10 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1570066579 / rank | |||
Normal rank | |||
Latest revision as of 19:37, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms for the Maximum Internal Spanning Tree Problem |
scientific article |
Statements
Approximation Algorithms for the Maximum Internal Spanning Tree Problem (English)
0 references
17 September 2008
0 references
approximation algorithm
0 references
spanning tree leaves
0 references
Hamiltonian path
0 references
