论文部分内容阅读
本文着重研究了用最小生成树和低生成树对数据进行压缩存贮和检索的理论与技术。首先对问题做了形式地定义,接着给出了有关最小生成树和和低生成树的算法。同时对该方法的有效性进行了分析和讨论。
This thesis focuses on the theory and technology of compressing and retrieving data using minimum spanning tree and low spanning tree. The problem was first formally defined, followed by algorithms for minimum spanning tree and low spanning tree. At the same time, the effectiveness of this method is analyzed and discussed.