uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
One, two and three times log n/n for paths in a complete graph with random weights
Uppsala University.
1999 (English)In: COMBINATORICS PROBABILITY & COMPUTING, Vol. 8, no 4, 347-361 p.Article in journal (Other scientific) Published
Abstract [en]

Consider the minimal weights of paths between two points in a complete graph K-n with random weights on the edges, the weights being, for instance, uniformly distributed. It is shown that, asymptotically, this is log n/n for two given points, that the max

Place, publisher, year, edition, pages
CAMBRIDGE UNIV PRESS , 1999. Vol. 8, no 4, 347-361 p.
URN: urn:nbn:se:uu:diva-26940OAI: oai:DiVA.org:uu-26940DiVA: diva2:54834
Addresses: Janson S, Uppsala Univ, Dept Math, POB 480, S-75106 Uppsala, Sweden. Uppsala Univ, Dept Math, S-75106 Uppsala, Sweden.Available from: 2008-10-17 Created: 2008-10-17 Last updated: 2011-01-14

Open Access in DiVA

No full text

By organisation
Uppsala University

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 172 hits
ReferencesLink to record
Permanent link

Direct link