Book · 1984

Graph algorithms and NP-completeness

Kurt Mehlhorn

Springer Nature · Published 1 September 1984

View at the publisherCite this paper

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

YearCitationsShare of the best year
201222
201355
201422
201522
201722
201822
201911
202122
202211

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

All highly cited Computer Science papers

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.