A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829)
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 7631931
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A greedy algorithm for finding maximum spanning trees in infinite graphs |
scientific article; zbMATH DE number 7631931 |
Statements
A greedy algorithm for finding maximum spanning trees in infinite graphs (English)
0 references
12 December 2022
0 references
spanning trees
0 references
infinite graphs
0 references
infinite-dimensional optimization
0 references
0 references
0 references
0.7898082137107849
0 references
0.7390468120574951
0 references
0.7258838415145874
0 references
0.7234449982643127
0 references
