欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对大规模移动对象网络在构建图立方体的过程中产生的大量浓缩图,引入了图压缩的思想,提出了进一步压缩浓缩图的算法MC-compress,用来合并浓缩图中顶点和相应的边.通过将图中相邻的两个顶点进行合并,再比较两条边合并后权重的最大差异度,从而找出最优的合并顶点对,最终产生构建压缩图的超级顶点和超级边.通过压缩图结构,加快了在图立方体上查询图结构的显示过程,减少了构建图立方体过程中存储大量浓缩图的空间.
英文摘要：
Aimed at the amount of aggregation graphs of moving objects network produced by building graph cube,introducing the idea of compressing graph,putting forward the algorithm of compressing aggregation graph MC-compress method used to merge vertices and edges in the aggregation graph.Comparing the largest differences of weight of two edges when merging two vertexes in the aggregation graph,and to find the optimal merging pairs of vertices,finally,generating the super vertexes and super edges to construct compressed graph.The method speeds up the displaying after querying graph structure in graph cube and reducing the space used to store large amounts of aggression graph in the process of building graph cube.
同期刊论文项目
同项目期刊论文
期刊信息
位置：