A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence (Q4985352)
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: A fast algorithm to find all high-degree vertices in graphs with a power-law degree sequence |
scientific article; zbMATH DE number 7337003
| 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 7337003 |
Statements
A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence (English)
0 references
23 April 2021
0 references
0.9891904592514038
0 references
0.768325924873352
0 references
0.7555404901504517
0 references
0.7533153295516968
0 references
0.7475722432136536
0 references
