助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   algorithm of multilevel graph partitioning 的翻译结果: 查询用时:0.007秒
图标索引 在分类学科中查询
所有学科
互联网技术
更多类别查询

图标索引 历史查询
 

algorithm of multilevel graph partitioning
相关语句
  “algorithm of multilevel graph partitioning”译为未确定词的双语例句
     After analyzing the algorithm of multilevel graph partitioning,in the graph-coarsening phase,two new algorithms named KV and VC are put forward based on the rule of vertex collapse instead of links′.
     在多级分割算法的图塌缩阶段,提出改进算法———KV算法和VC算法.
短句来源
  相似匹配句对
     Graph K-Partitioning Algorithm based on DBOA
     基于决策图贝叶斯优化进化算法的图K-划分算法
短句来源
     A Stochastic Algorithm for Graph K-Partitioning
     一种图K划分的随机算法
短句来源
     Visualization of graph algorithm
     基于MVC的图算法可视化的实现
短句来源
     Graph Coloring Algorithm
     关于图染色的算法
短句来源
     Study on ant colony clustering algorithm based on graph partitioning
     基于图分割的蚁群聚类算法
短句来源
查询“algorithm of multilevel graph partitioning”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


Graph partitioning is a vital way to solve the problem of macroscopically visualizing the abnormal event on the network topology.In order to gain a much clearer global picture of macroscopical abnormal event overspreading on the network topology,it is very important to propose an effective algorithm of graph partitioning.After analyzing the algorithm of multilevel graph partitioning,in the graph-coarsening phase,two new algorithms named KV and VC are put forward based on the rule of vertex...

Graph partitioning is a vital way to solve the problem of macroscopically visualizing the abnormal event on the network topology.In order to gain a much clearer global picture of macroscopical abnormal event overspreading on the network topology,it is very important to propose an effective algorithm of graph partitioning.After analyzing the algorithm of multilevel graph partitioning,in the graph-coarsening phase,two new algorithms named KV and VC are put forward based on the rule of vertex collapse instead of links′.The comparing experimental results verified the advantage of our algorithms.It′s proved that the KV algorithm decreased by 4.6?% in edge-cuts and increased by 12?% in execute time.And the VC algorithm proved to be effective in time complexity decreasing based on the KV algorithm.

针对网络拓扑图上的宏观异常预警可视化显示需要,分析了当前图的多级划分算法.算法分为图塌缩、初始划分和多级优化三个阶段.在多级分割算法的图塌缩阶段,提出改进算法———KV算法和VC算法.实验验证改进后算法在运行时间、恢复时间和分割边数上均优于传统算法.改进塌缩KV算法在分割边数上平均提高了4.6%,在运行时间上提高了12%,而VC算法降低了KV算法的时间复杂度.

 
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关algorithm of multilevel graph partitioning的内容
在知识搜索中查有关algorithm of multilevel graph partitioning的内容
在数字搜索中查有关algorithm of multilevel graph partitioning的内容
在概念知识元中查有关algorithm of multilevel graph partitioning的内容
在学术趋势中查有关algorithm of multilevel graph partitioning的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社