A PARALLEL ALGORITHM FOR GENERATINGMULTIPLE ORDERING SPANNING TREESIN UNDIRECTED WEIGHTED GRAPHS

被引：0
作者：
马军
马绍汉
岩间一雄
顾谦平
机构：
来源：
Acta Mathematicae Applicatae Sinica(English Series) | 1999年 / 03期
关键词：
Parallel algorithms; minimum spanning trees; networks; graph algorithms;
D O I：
暂无
中图分类号：
O241 [数值分析];
学科分类号：
070102 ;
摘要：
1.IntroductionLetG=(V,E,W)beaconnected,weightedandundirectedgraph,VeEE,w(e)(<co)representstheweightofe.Theminimumspaedngtreeproblem(MST)istofindthespanningtreeTIwiththeminimumweight,wheretheweightofaspanningtreeTisw(T)=Zw(e).Thenthejibminimumsp~ngtre...
引用
收藏
页码：303 / 309
页数：7
相关论文
共 3 条
[1]  
Bounds on Backtrack Algorithms for Listing Cycles; Paths; and SpanningTrees..R.C. Read; R.E. Tarjan;.Networks.1975,
[2]  
A Simple Algorithm for Listing all the Thees of a Graph..D.J. Minty;.IEEE Trans. Circuit Theory.1965,
[3]  
An Introduction to Parallel Algorithms..J. JaJa;.Addison-Wesley Publishing Companyl Inc. NewYork.1992,
1