\Gamma-ary Clustering with Optimal Leaf Ordering

Our \Xi-ary construction algorithm runs in \Pi \Upsilon \Sigma \Psi \Phi ff\Omega flfi re-gardless of \Xi and our ordering algorithm runs in \Pi \Upsilon \Sigma \Psi ffiifflfl\Phi j\Omega `fi. We present several examples that show that our \Xi-aryclustering algorithm achieves results that are superior to the binary tree results in both global presentation andcluster identification. ' To whom correspondence should be addressed Availability: We have implemented the above algorithmsin C++ on the Linux operating system. Source code is available upon request from zivbj@mit.edu