Jonathan Stokes, Steven Weber. Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree. Inf. Process. Lett., 139:53-59, 2018. [doi]
@article{StokesW18-0, title = {Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree}, author = {Jonathan Stokes and Steven Weber}, year = {2018}, doi = {10.1016/j.ipl.2018.07.003}, url = {https://doi.org/10.1016/j.ipl.2018.07.003}, researchr = {https://researchr.org/publication/StokesW18-0}, cites = {0}, citedby = {0}, journal = {Inf. Process. Lett.}, volume = {139}, pages = {53-59}, }