"Common greedy wiring and rewiring heuristics do not guarantee maximum ..."

Jonathan Stokes, Steven Weber (2017)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2019-11-04

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/StokesW17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/StokesW17
Jonathan Stokes, Steven Weber:
Common greedy wiring and rewiring heuristics do not guarantee maximum assortative graphs of given degree. CoRR abs/1705.00382 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.