APA (7th ed.) Citation

Wagner, A., & Corneil, D. G. (1987). Embedding trees in a hypercube is NP-complete. Univ. of Toronto, Dep. of Computer Science.

Chicago Style (17th ed.) Citation

Wagner, A., and D. G. Corneil. Embedding Trees in a Hypercube Is NP-complete. Toronto: Univ. of Toronto, Dep. of Computer Science, 1987.

MLA (9th ed.) Citation

Wagner, A., and D. G. Corneil. Embedding Trees in a Hypercube Is NP-complete. Univ. of Toronto, Dep. of Computer Science, 1987.