APA (7th ed.) Citation

Hyafil, L., & Rivest, R. L. (1973). Graph partitioning and constructing optimal decision trees are polynomial complete problems. IRIA.

Chicago Style (17th ed.) Citation

Hyafil, Laurent, and R. L. Rivest. Graph Partitioning and Constructing Optimal Decision Trees Are Polynomial Complete Problems. Rocquencourt: IRIA, 1973.

MLA (9th ed.) Citation

Hyafil, Laurent, and R. L. Rivest. Graph Partitioning and Constructing Optimal Decision Trees Are Polynomial Complete Problems. IRIA, 1973.