Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree

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]

Abstract

Abstract is missing.