mohammad@hpclmp.HP.COM (Mohammad Pourheidari) (11/03/90)
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.