Greed is good for deterministic scale-free networks (Q4636581)
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 6862061
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Greed is good for deterministic scale-free networks |
scientific article; zbMATH DE number 6862061 |
Statements
19 April 2018
0 references
random graphs
0 references
power-law degree distribution
0 references
scale-free networks
0 references
PLB networks
0 references
approximation algorithms
0 references
vertex cover
0 references
dominating set
0 references
independent set
0 references
Greed is Good for Deterministic Scale-Free Networks. (English)
0 references
0.9835485816001892
0 references
0.7926502823829651
0 references
0.7859821319580078
0 references
0.7817052006721497
0 references
0.7710821628570557
0 references
