MathSciNet Relay Station
MathSciNet bibliographic data
MR1611522 68R10 (05C05 05C85)
McDiarmid, Colin; Johnson, Theodore; Stone, Harold S. On finding a minimum spanning tree in a network with random weights. Average-case analysis of algorithms (Dagstuhl, 1995). Random Structures Algorithms 10 (1997), no. 1-2, 187–204.
For users without a MathSciNet license , Relay Station allows linking from MR numbers in online mathematical literature directly to electronic journals and original articles. Subscribers receive the added value of full MathSciNet reviews.

Username/Password Subscribers access MathSciNet here

AMS Home Page

American Mathematical Society American Mathematical Society
201 Charles Street
Providence, RI 02904-6248 USA
© Copyright 2017, American Mathematical Society
Privacy Statement