Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (Q1799575): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q115926523, #quickstatements; #temporary_batch_1714786519576 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q115926523 / rank | |||
Normal rank | |||
Revision as of 02:56, 4 May 2024
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
