Sampling networks by the union of \(m\) shortest path trees (Q969033)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sampling networks by the union of m shortest path trees |
scientific article; zbMATH DE number 5706998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sampling networks by the union of \(m\) shortest path trees |
scientific article; zbMATH DE number 5706998 |
Statements
Sampling networks by the union of \(m\) shortest path trees (English)
0 references
11 May 2010
0 references
network sampling
0 references
sampling bias
0 references
shortest path tree
0 references
weighted and unweighted networks
0 references
0.7889705300331116
0 references
0.7412634491920471
0 references
0.7392032742500305
0 references
0.724122941493988
0 references
