"The complexity of searching a graph."

Nimrod Megiddo et al. (1988)

> Home

Details and statistics

DOI: 10.1145/42267.42268

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jacm/MegiddoHGJP88
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jacm/MegiddoHGJP88
Nimrod Megiddo, S. Louis Hakimi, M. R. Garey, David S. Johnson, Christos H. Papadimitriou:
The complexity of searching a graph. J. ACM 35(1): 18-44 (1988)

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.