APA (7th ed.) Citation

Mehlhorn, K. (1984). Graph algorithms and NP-completeness. Springer-Verlag.

Chicago Style (17th ed.) Citation

Mehlhorn, Kurt. Graph Algorithms and NP-completeness. Berlin: Springer-Verlag, 1984.

MLA (8th ed.) Citation

Mehlhorn, Kurt. Graph Algorithms and NP-completeness. Springer-Verlag, 1984.

Warning: These citations may not always be 100% accurate.