Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3525559): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:57, 5 February 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
