%0 Journal Article %1 journals/corr/StokesW17 %A Stokes, Jonathan %A Weber, Steven %D 2017 %J CoRR %K dblp %T Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree. %U http://dblp.uni-trier.de/db/journals/corr/corr1705.html#StokesW17 %V abs/1705.00382

@article{journals/corr/StokesW17, added-at = {2019-11-04T00:00:00.000+0100}, author = {Stokes, Jonathan and Weber, Steven}, biburl = {https://www.bibsonomy.org/bibtex/20a1fc4d2db9de70d9136335df6b98fb0/dblp}, ee = {http://arxiv.org/abs/1705.00382}, interhash = {c64ab3b1cba6892f9fec5a1a7ac251ea}, intrahash = {0a1fc4d2db9de70d9136335df6b98fb0}, journal = {CoRR}, keywords = {dblp}, timestamp = {2019-11-05T11:38:41.000+0100}, title = {Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree.}, url = {http://dblp.uni-trier.de/db/journals/corr/corr1705.html#StokesW17}, volume = {abs/1705.00382}, year = 2017 }