"Maximum algebraic connectivity augmentation is NP-hard."

Damon Mosk-Aoyama (2008)

> Home

Details and statistics

DOI: 10.1016/J.ORL.2008.09.001

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/orl/Mosk-Aoyama08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/orl/Mosk-Aoyama08
Damon Mosk-Aoyama:
Maximum algebraic connectivity augmentation is NP-hard. Oper. Res. Lett. 36(6): 677-679 (2008)

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.