Book · 1984
Graph algorithms and NP-completeness
Springer Nature · Published 1 September 1984
In brief
“Graph algorithms and NP-completeness” is a 1984 book by Kurt Mehlhorn. OpenAlex counts 156 citations as of 16 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.
- Citations
- 156
- Most cited in
- 2013 (5)
- Field-weighted impact
- 3.69
- Authors
- 1
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Mehlhorn, K. (1984). Graph algorithms and NP-completeness. Springer Nature. http://ci.nii.ac.jp/ncid/BA00491948
MLA 9
Mehlhorn, Kurt. Graph algorithms and NP-completeness. Springer Nature, 1984. http://ci.nii.ac.jp/ncid/BA00491948.
Chicago
Mehlhorn, Kurt. 1984. Graph algorithms and NP-completeness. Springer Nature. http://ci.nii.ac.jp/ncid/BA00491948.
Harvard
Mehlhorn, K. (1984) Graph algorithms and NP-completeness. Springer Nature. Available at: http://ci.nii.ac.jp/ncid/BA00491948.
IEEE
K. Mehlhorn, Graph algorithms and NP-completeness. Springer Nature, 1984.
BibTeX
@book{mehlhorn1984graph,
title = {{Graph algorithms and NP-completeness}},
author = {Mehlhorn, Kurt},
publisher = {Springer Nature},
year = {1984},
url = {http://ci.nii.ac.jp/ncid/BA00491948}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2012 | 2 | |
| 2013 | 5 | |
| 2014 | 2 | |
| 2015 | 2 | |
| 2017 | 2 | |
| 2018 | 2 | |
| 2019 | 1 | |
| 2021 | 2 | |
| 2022 | 1 |
Its field-weighted citation impact is 3.69: it has been cited 3.69 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- graph algorithms
- NP-completeness
- computational complexity
- graph problems
- polynomial-time algorithms
Work with this paper
Most-cited papers in Computer Science
- ImageNet classification with deep convolutional neural networksAlex Krizhevsky, Ilya Sutskever, Geoffrey E. Hinton · Communications of the ACM · 2017 · 114,726 citations
- Long Short-Term MemorySepp Hochreiter, Jürgen Schmidhuber · Neural Computation · 1997 · 109,097 citations
- A Mathematical Theory of CommunicationClaude E. Shannon · Bell System Technical Journal · 1948 · 91,736 citations
- Deep learningYann LeCun, Yoshua Bengio, Geoffrey E. Hinton · Nature · 2015 · 90,226 citations
- Faster R-CNN: Towards Real-Time Object Detection with Region Proposal NetworksShaoqing Ren, Kaiming He, Ross Girshick and 1 more · IEEE Transactions on Pattern Analysis and Machine Intelligence · 2016 · 74,143 citations
Questions about this paper
How do I cite this paper in APA style?
Mehlhorn, K. (1984). Graph algorithms and NP-completeness. Springer Nature. http://ci.nii.ac.jp/ncid/BA00491948
How many times has this paper been cited?
156 times, according to OpenAlex on 16 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.
Who wrote this paper?
Kurt Mehlhorn.
Bibliographic data from OpenAlex (CC0), last checked 16 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.