"On the Conduciveness of Random Network Graphs for Maximal Assortative or ..."

Natarajan Meghanathan (2016)

> Home

Details and statistics

DOI: 10.5539/CIS.V9N1P21

access: open

type: Journal Article

metadata version: 2020-07-09

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ccsecis/Meghanathan16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ccsecis/Meghanathan16
Natarajan Meghanathan:
On the Conduciveness of Random Network Graphs for Maximal Assortative or Maximal Dissortative Matching. Comput. Inf. Sci. 9(1): 21-30 (2016)

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.