首页> 外文OA文献 >Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs

【2h】

Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs

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

页面导航

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

著录项

作者
Sanjiv Kapoor; H. Ramesh;
展开▼
作者单位

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

相似文献

外文文献
中文文献
专利

1. ALGORITHMS FOR ENUMERATING ALL SPANNING TREES OF UNDIRECTED AND WEIGHTED GRAPHS [J] . Kapoor S., Ramesh H. SIAM Journal on Computing . 1995,第2期

机译：算出所有无向权图和加权图的跨树的算法
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 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期

机译：生成简单无向连通图的所有可能生成树的算法：广泛的回顾
4. Determining minimum spanning tree in an undirected weighted graph [C] . Rai Shikha, Sharma Swati 2015 International Conference on Advances in Computer Engineering and Applications . 2015

机译：确定无向加权图中的最小生成树
5. On the enumeration of colored spanning trees in a graph. [D] . Buliga, Marius Georgel. 2002

机译：关于图中彩色生成树的枚举。
6. The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees [O] . Sofie Demeyer, Tom Michoel, Jan Fostier, -1

机译：基于索引的子图匹配算法（ISMA）：使用优化的搜索树在大型网络中进行快速子图枚举
7. A Flexible Algorithm For Generating All The Spanning Trees In Undirected Graphs [O] . Tomomi Matsui 1997

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

Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs

著录项

引文网络

相似文献

相关主题

期刊订阅