An approximation algorithm for maximum internal spanning tree (Q1743498)
From MaRDI portal
(Redirected from Item:Q2980926)
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An approximation algorithm for maximum internal spanning tree |
scientific article; zbMATH DE number 6711902
- An Approximation Algorithm for Maximum Internal Spanning Tree
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for maximum internal spanning tree |
scientific article; zbMATH DE number 6711902 |
|
Statements
An approximation algorithm for maximum internal spanning tree (English)
0 references
An Approximation Algorithm for Maximum Internal Spanning Tree (English)
0 references
13 April 2018
0 references
5 May 2017
0 references
approximation algorithms
0 references
graph algorithms
0 references
spanning trees
0 references
path-cycle covers
0 references
0 references
0 references
0 references
0.995005190372467
0 references
0.932819366455078
0 references
0.8935242295265198
0 references
0.8901335597038269
0 references