Clustering by clique generation /

Originally presented as the author's thesis (M.A.), University of Illinois at Urbana-Champaign.

Two upper bounds for the weighted path length of binary trees.

Thesis (M.S.)--University of Illinois at Urbana-Champaign.

Generating k-ary trees lexicographically /

"UILU-ENG 77 1758."

A procedure for detecting intersections and its application.

Bibliography: p. 72-74.