"The NP-Completeness of the bandwidth minimization problem."

Christos H. Papadimitriou (1976)

> Home

Details and statistics

DOI: 10.1007/BF02280884

access: closed

type: Journal Article

metadata version: 2020-08-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computing/Papadimitriou76
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/Papadimitriou76
Christos H. Papadimitriou:
The NP-Completeness of the bandwidth minimization problem. Computing 16(3): 263-270 (1976)

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.