default search action

combined dblp search
author search
venue search
publication search

ask others

Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID

"The Complexity of Near-Optimal Graph Coloring."

M. R. Garey, David S. Johnson (1976)

> Home

Details and statistics

DOI: 10.1145/321921.321926

access: closed

type: Journal Article

metadata version: 2020-05-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/GareyJ76a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/GareyJ76a
M. R. Garey, David S. Johnson:
The Complexity of Near-Optimal Graph Coloring. J. ACM 23(1): 43-49 (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.