首页> 外文OA文献 >A Flexible Algorithm For Generating All The Spanning Trees In Undirected Graphs

【2h】

A Flexible Algorithm For Generating All The Spanning Trees In Undirected Graphs

机译：一种在无向图中生成所有生成树的灵活算法

页面导航

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

著录项

作者
Tomomi Matsui;
展开▼
作者单位

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

相似文献

外文文献
中文文献
专利

1. Algorithms for generating all possible spanning trees of a simple undirected connected graph: an extensive review [J] . Maumita Chakraborty, Sumon Chowdhury, Joymallya Chakraborty, Complex & Intelligent Systems . 2018,第3期

机译：生成简单无向连通图的所有可能生成树的算法：广泛的回顾
2. A parallel algorithm for generating multiple ordering spanning trees in undirected weighted graphs [J] . Ma Jun, Ma Shaohan, Kazhu Iwama Acta Mathematicae Applicatae Sinica . 1999,第3期

机译：在无向加权图中生成多个有序生成树的并行算法
3. ALGORITHMS FOR ENUMERATING ALL SPANNING TREES OF UNDIRECTED AND WEIGHTED GRAPHS [J] . Kapoor S., Ramesh H. SIAM Journal on Computing . 1995,第2期

机译：算出所有无向权图和加权图的跨树的算法
4. A Novel Genetic Algorithm Based on All Spanning Trees of Undirected Graph for Distribution Network Reconfiguration [C] . ZHANG Jian, YUAN Xiaodong International Conference on Energy and Environmental Protection . 2014

机译：一种新型遗传算法，基于用于分发网络重新配置的无向图的所有跨度树木
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. Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs [O] . Sanjiv Kapoor, H. Ramesh 1995

机译：枚举无向图和加权图的所有生成树的算法

A Flexible Algorithm For Generating All The Spanning Trees In Undirected Graphs

著录项

引文网络

相似文献

相关主题

期刊订阅