A fast algorithm to find all high degree vertices in graphs with a power law degree sequence (Q2900595)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6059569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm to find all high degree vertices in graphs with a power law degree sequence |
scientific article; zbMATH DE number 6059569 |
Statements
A Fast Algorithm to Find All High Degree Vertices in Graphs with a Power Law Degree Sequence (English)
0 references
23 July 2012
0 references
biassed random walk
0 references
0.9891904592514038
0 references
0.7861383557319641
0 references
0.7674425840377808
0 references
0.7657583355903625
0 references
0.7622820734977722
0 references
