IMPROVED ALGORITHM FOR CONSTRUCTION OF MINIMAL SPANNING TREES

被引：4

|

作者：

PYNN, C

WARREN, JH

机构：

来源：

ELECTRONICS LETTERS | 1972年 / 8卷 / 06期

关键词：

D O I：

10.1049/el:19720104

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

引用

收藏

页码：143 / &

相关论文

共 50 条

[41] Improved bounds for spanning trees with many leaves
Bonsma, Paul
Zickfeld, Florian
DISCRETE MATHEMATICS, 2012, 312 (06) : 1178 - 1194
[42] The Complexity and Algorithm for Minimum Expense Spanning Trees
Zhan Ning
Wu Longshu
2012 INTERNATIONAL WORKSHOP ON INFORMATION AND ELECTRONICS ENGINEERING, 2012, 29 : 118 - 122
[43] A Table Based Algorithm for MinimumDirected Spanning Trees
Feng Junwen School of Economics and Management
Journal of Systems Engineering and Electronics, 2001, (01) : 22 - 28
[44] NEW ALGORITHM FOR GENERATION OF SPANNING-TREES
CHERKASSKII, BV
CYBERNETICS, 1987, 23 (01): : 107 - 113
[45] An algorithm to generate all spanning trees with flow
Lin, YK
MATHEMATICAL AND COMPUTER MODELLING, 2002, 35 (13) : 1453 - 1458
[46] A faster deterministic algorithm for minimum spanning trees
Chazelle, B
38TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1997, : 22 - 34
[47] Improved Genetic Algorithm for Distribution System Performance Analysis by Taking Advantage of Essential Spanning Trees
Ji, Yanzhu
Shi, Zhuoqun
O'Connell, Robert M.
JOURNAL OF ENGINEERING, 2018, 2018
[48] MINIMAL GRAPHS FOR COMPLETELY INDEPENDENT SPANNING TREES AND COMPLETELY INDEPENDENT SPANNING TREES IN COMPLETE T-PARTITE GRAPH
Hong, Xia
Gao, Feng
Wu, Zengbao
CONTRIBUTIONS TO DISCRETE MATHEMATICS, 2024, 19 (02) : 23 - 35
[49] An improved algorithm for computing Steiner minimal trees in Euclidean d-space
Fampa, Marcia
Anstreicher, Kurt M.
DISCRETE OPTIMIZATION, 2008, 5 (02) : 530 - 540
[50] A FULLY DISTRIBUTED (MINIMAL) SPANNING TREE ALGORITHM
LAVALLEE, I
ROUCAIROL, G
INFORMATION PROCESSING LETTERS, 1986, 23 (02) : 55 - 62

← 1 2 3 4 5 →