Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (Q1799575)
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 6958545
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree |
scientific article; zbMATH DE number 6958545 |
Statements
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (English)
0 references
19 October 2018
0 references
assortativity
0 references
graph wiring
0 references
graph rewiring
0 references
graph algorithms
0 references
0.7388970851898193
0 references
0.7099446058273315
0 references
0.7099190354347229
0 references
0.7079203724861145
0 references
0.6945462226867676
0 references
