3 citations · 3 across the 2 of their papers we have counts for
1 paper · 1 filter
Jonathan Stokes, Steven Weber
We examine two greedy heuristics - wiring and rewiring - for constructing maximum assortative graphs over all simple connected graphs with a target degree sequence. Counterexamples…