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]

Authors

Jonathan Stokes

This author has not been identified. Look up 'Jonathan Stokes' in Google

Steven Weber

This author has not been identified. Look up 'Steven Weber' in Google