Path: utzoo!utgpu!news-server.csri.toronto.edu!rutgers!mit-eddie!uw-beaver!Teknowledge.COM!unix!hplabs!hpda!hpcuhb!hpcllla!hpclisp!hpclmp!mohammad
From: mohammad@hpclmp.HP.COM (Mohammad Pourheidari)
Newsgroups: comp.ai
Subject: subgraph collapsing
Message-ID: <55690003@hpclmp.HP.COM>
Date: 2 Nov 90 23:43:31 GMT
Organization: Hewlett-Packard Calif. Language Lab
Lines: 9

I am looking for good algorithms or implementations the come up with
supernodes in trees that represent a class of other nodes.  So, for 
example when I apply this algorithm to my tree, the tree should be
redrawn (or the database should be recalculated) so that I have a
smaller set of nodes which represent the previously larger tree that
I had.  This has (I think) traditionally been addressed as a partitioning
problem in trees.

thanks, M.