首页> 外文OA文献 >An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree

【2h】

An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree

机译：基于蚁群的度约束最小生成树算法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Thang N. Bui; Catherine M. Zrncic;
展开▼
作者单位

展开▼
年度 2013
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. An Improved Ant-Based Algorithm for the Degree-Constrained Minimum Spanning Tree Problem [J] . Bui T.N. Evolutionary Computation, IEEE Transactions on . 2012,第2期

机译：改进的基于蚁群算法的度约束最小生成树问题
2. A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem [J] . Soft computing: A fusion of foundations, methodologies and applications . 2020,第3期

机译：一种杂交遗传算法，用于程度约束的最小生成树问题
3. A new algorithm for degree-constrained minimum spanning tree based on the reduction technique [J] . Aibing Ning, Liang Ma, Xiaohua Xiong 自然科学进展（英文版） . 2008,第004期

机译：一种基于约简技术的度约束最小生成树新算法
4. An ant-based algorithm for finding degree-constrained minimum spanning tree [C] . Thang N. Bui, Catherine M. Zrncic Annual conference on Genetic and evolutionary computation;Conference on Genetic and evolutionary computation . 2006

机译：一种基于蚂蚁算法的度约束最小生成树算法
5. Design and implementation of parallel graph algorithms for minimum spanning tree, list ranking, and root finding on trees. [D] . Chung, Sun Bong. 1998

机译：并行图算法的设计和实现，用于最小生成树，列表排序和树的根查找。
6. Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm Minimum Spanning Tree and Hierarchical Clustering in an Applied Study [O] . Saeedeh Pourahmad, Atefeh Basirat, Amir Rahimi, 2020

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法最小生成树和分层聚类的三种混合方法的比较
7. Degree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm [O] . Keke Liu, Zhenxiang Chen, Ajith Abraham, 2013

机译：基于遗传算法的度约束最小生成树问题

An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree

著录项

引文网络

相似文献

相关主题

期刊订阅