Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree
From MaRDI portal
Publication:1799575
DOI10.1016/j.ipl.2018.07.003zbMath1478.68263arXiv1705.00382OpenAlexW2964125296WikidataQ115926523 ScholiaQ115926523MaRDI QIDQ1799575
Publication date: 19 October 2018
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.00382
Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- Practical graph isomorphism. II.
- Combinatorial Properties of Matrices of Zeros and Ones
- Algorithms and complexity results for finding graphs with extremal Randić index
- Constructing and sampling graphs with a prescribed joint degree distribution
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications