Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree (Q1799575): Difference between revisions

@@ Property / OpenAlex ID @@
+W2964125296
@@ Property / OpenAlex ID: W2964125296 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00382
@@ Property / arXiv ID: 1705.00382 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q115926523
@@ Property / Wikidata QID: Q115926523 / rank @@
+Normal rank
@@ Property / cites work @@
+Influence of assortativity and degree-preserving rewiring on the spectra of networks
+Normal rank
@@ Property / cites work @@
+Algorithms and complexity results for finding graphs with extremal Randić index
+Normal rank
@@ Property / cites work @@
+Constructing and sampling graphs with a prescribed joint degree distribution
+Normal rank
@@ Property / cites work @@
+Q3942995
@@ Property / cites work: Q3942995 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Properties of Matrices of Zeros and                         Ones
+Normal rank
@@ Property / cites work @@
+Q4262220
@@ Property / cites work: Q4262220 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5395264
@@ Property / cites work: Q5395264 / rank @@
+Normal rank
@@ Property / cites work @@
+Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
+Normal rank
@@ Property / cites work @@
+Practical graph isomorphism. II.
@@ Property / cites work: Practical graph isomorphism. II. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3287781
@@ Property / cites work: Q3287781 / rank @@
+Normal rank