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

Jonathan Stokes, Steven Weber (2018)

> Home

Details and statistics

DOI: 10.1016/J.IPL.2018.07.003

access: closed

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ipl/StokesW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ipl/StokesW18
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)

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.