A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2022.10.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4305072505 / rank | |||
Normal rank | |||
Revision as of 22:08, 19 March 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
