A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A 2-approximation algorithm for finding a spanning tree with maximum number of leaves |
scientific article |
Statements
A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (English)
0 references
3 March 2017
0 references
approximation algorithm
0 references
graphs
0 references
optimization
0 references
0 references
0 references
0 references
0 references
