On finding a minimum spanning tree in a network with random weights (Q3122913): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| label / en | label / en | ||
On finding a minimum spanning tree in a network with random weights | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<187::aid-rsa10>3.0.co;2-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2024533455 / rank | |||
Normal rank | |||
| Property / title | |||
On finding a minimum spanning tree in a network with random weights (English) | |||
| Property / title: On finding a minimum spanning tree in a network with random weights (English) / rank | |||
Normal rank | |||
Latest revision as of 09:29, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding a minimum spanning tree in a network with random weights |
scientific article |
Statements
1 October 1997
0 references
minimum spanning tree
0 references
independent identically distributed random weights
0 references
0 references
0 references
On finding a minimum spanning tree in a network with random weights (English)
0 references
