"Maximizing edge-ratio is NP-complete."

Steven D. Noble, Pierre Hansen, Nenad Mladenovic (2011)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2011.07.016

access: open

type: Journal Article

metadata version: 2023-03-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dam/NobleHM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/NobleHM11
Steven D. Noble, Pierre Hansen, Nenad Mladenovic:
Maximizing edge-ratio is NP-complete. Discret. Appl. Math. 159(18): 2276-2280 (2011)

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.