BibTeX record journals/jacm/MegiddoHGJP88

download as .bib file

@article{DBLP:journals/jacm/MegiddoHGJP88,
  author       = {Nimrod Megiddo and
                  S. Louis Hakimi and
                  M. R. Garey and
                  David S. Johnson and
                  Christos H. Papadimitriou},
  title        = {The complexity of searching a graph},
  journal      = {J. {ACM}},
  volume       = {35},
  number       = {1},
  pages        = {18--44},
  year         = {1988},
  url          = {https://doi.org/10.1145/42267.42268},
  doi          = {10.1145/42267.42268},
  timestamp    = {Sun, 02 Jun 2019 20:59:12 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/MegiddoHGJP88.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.