A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829): Difference between revisions
From MaRDI portal
Latest revision as of 02:40, 17 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A greedy algorithm for finding maximum spanning trees in infinite graphs |
scientific article |
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