On finding a minimum spanning tree in a network with random weights (Q3122913): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q800826
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
On finding a minimum spanning tree in a network with random weights
Property / author
 
Property / author: Colin J. H. McDiarmid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random tree model associated with random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The continuum random tree. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic fringe distributions for general families of random trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum spanning tree constant in geometrical probability and under the independent model: A unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random recursive forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the value of a random minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On random minimum length spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Components of Random Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the heights of random recursive trees and random <i>m</i>‐ary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding the Expected Length of a Random Minimal Tree / rank
 
Normal rank
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

    0 references
    0 references
    0 references
    1 October 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    minimum spanning tree
    0 references
    independent identically distributed random weights
    0 references
    0 references
    On finding a minimum spanning tree in a network with random weights (English)
    0 references