An approximation algorithm for maximum internal spanning tree (Q6827708)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6859598
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An approximation algorithm for maximum internal spanning tree |
scientific article; zbMATH DE number 6859598 |
Statements
An approximation algorithm for maximum internal spanning tree (English)
0 references
13 April 2018
0 references
approximation algorithms
0 references
graph algorithms
0 references
spanning trees
0 references
path-cycle covers
0 references
