Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (Q1799575)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree |
scientific article |
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
