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

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
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.
Identifiers
URN: urn:nbn:se:uu:diva-26940OAI: oai:DiVA.org:uu-26940DiVA: diva2:54834
Note
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

urn-nbn

Altmetric score

urn-nbn
Total: 387 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf