首页 > 《应用数学学报：英文版》 > 1999年3期 > A PARALLEL ALGORITHM FOR GENERATING MULTIPLE ORDERING SPANNING TREES IN UNDIRECTED WEIGHTED GRAPHS

A PARALLEL ALGORITHM FOR GENERATING MULTIPLE ORDERING SPANNING TREES IN UNDIRECTED WEIGHTED GRAPHS

打印

在线阅读下载PDF 导出详情

摘要 1.IntroductionLetG=(V,E,W)beaconnected,weightedandundirectedgraph,VeEE,w(e)(

DOI mpj0667wjy/144199

作者马军;马绍汉;岩间一雄;顾谦平

机构地区不详

出处《应用数学学报：英文版》 1999年3期

关键词 Parallel ALGORITHMS minimum SPANNING trees networks

分类 [理学][基础数学]

出版日期 1999年03月13日（中国Betway体育网页登陆平台首次上网日期，不代表论文的发表时间）

相关文献

1刘振宏;金国平.SPANNING TRAILS OF GRAPHS.系统科学,1991-01.
2WAN Jian-yi LI Xiao-ying.Approach of generating parallel programs from parallelized algorithm design strategies.通信与信息系统,2008-03.
3Ze-min JINi;Xue-liang LI.Partitioning Complete Graphs by Heterochromatic Trees.基础数学,2012-04.
4Li ZHANG;Yue LIU.Ordering Trees with Nearly Perfect Matchings by Algebraic Connectivity.基础数学,2008-01.
5XuJunming;FanYingmei.SUPER EDGE-CONNECTIVITY OF DE BRUIJN AND KAUTZ UNDIRECTED GRAPHS.基础数学,2004-04.
6Shao-qiangZhang;Guo-junLi;Shu-guangLi.A Linear Time Algorithm for the Minimum-weight Feedback Vertex Set Problem in Series-parallel Graphs.基础数学,2004-04.
7孙立山;孙雨耕;杨山.THE AUGMENTATION OF UNDIRECTED WEIGHTED GRAPH TO A K-EDGE-CONNECTED GRAPH.物理电子学,1992-03.
8Belgacem BETTAYEB Imed KACEM Kondo H. ADJALLAH.AN IMPROVED BRANCH-AND-BOUND ALGORITHM TO MINIMIZE THE WEIGHTED FLOWTIME ON IDENTICAL PARALLEL MACHINES WITH FAMILY SETUP TIMES.系统科学,2008-04.
9YONGXUERONG;ZHANGFUJI.AN ASYMPTOTIC PROPERTY OF THE NUMBER OF SPANNING TREES OF DOUBLE FIXED STEP LOOP NETWORKS.基础数学,1997-02.
10.AN　ASYMPTOTIC　PROPERTY　OF　THE　NUMBER　OF　SPANNING　TREES　OF　DOUBLE　FIXED　STEP　LOOP　NETWORKS.基础数学,1997-02.

来源期刊

应用数学学报：英文版

应用数学学报：英文版

相关推荐

同分类资源更多

相关关键词

Parallel ALGORITHMS minimum SPANNING trees networks

返回顶部