Near-linear time algorithm for approximate minimum degree spanning trees (Q2081596)
From MaRDI portal
 | 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: Near-linear time algorithm for approximate minimum degree spanning trees |
scientific article; zbMATH DE number 7600761
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Near-linear time algorithm for approximate minimum degree spanning trees |
scientific article; zbMATH DE number 7600761 |
Statements
Near-linear time algorithm for approximate minimum degree spanning trees (English)
0 references
13 October 2022
0 references
approximate algorithm
0 references
graph algorithm
0 references
minimum degree spanning tree
0 references
