MINIMAL SPANNING-TREES IN UNDIRECTED NETWORKS WITH EXPONENTIALLY DISTRIBUTED ARC WEIGHTS

被引：8

|

作者：

KULKARNI, VG

机构：

来源：

NETWORKS | 1988年 / 18卷 / 02期

关键词：

D O I：

10.1002/net.3230180204

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：111 / 124

页数：14

相关论文

共 50 条

[21] OPTIMUM COMMUNICATION SPANNING-TREES IN SERIES-PARALLEL NETWORKS
ELMALLAH, ES
COLBOURN, CJ
SIAM JOURNAL ON COMPUTING, 1985, 14 (04) : 915 - 925
[22] A DISTRIBUTED ALGORITHM FOR MINIMUM WEIGHT SPANNING-TREES BASED ON ECHO ALGORITHMS
AHUJA, M
ZHU, Y
9TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, 1989, : 2 - 8
[23] INFINITE, HIGHLY CONNECTED DIGRAPHS WITH NO 2 ARC-DISJOINT SPANNING-TREES
AHARONI, R
THOMASSEN, C
JOURNAL OF GRAPH THEORY, 1989, 13 (01) : 71 - 74
[24] GROWTH-RATES OF EUCLIDEAN MINIMAL SPANNING-TREES WITH POWER WEIGHTED EDGES
STEELE, JM
ANNALS OF PROBABILITY, 1988, 16 (04): : 1767 - 1787
[25] MAXIMIZING THE NUMBER OF SPANNING-TREES OF NETWORKS BASED ON CYCLE BASIS REPRESENTATION
TSENG, SS
WANG, LR
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1989, 29 (2-4) : 65 - 74
[26] MAXIMIZING THE NUMBER OF SPANNING-TREES OF NETWORKS BASED ON CYCLE BASIS REPRESENTATION
TSENG, SS
WANG, LR
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1989, 28 (1-4) : 47 - 56
[27] Minimum spanning trees in networks with varying edge weights
Kevin R. Hutson
Douglas R. Shier
Annals of Operations Research, 2006, 146 : 3 - 18
[28] Minimum spanning trees in networks with varying edge weights
Hutson, Kevin R.
Shier, Douglas R.
ANNALS OF OPERATIONS RESEARCH, 2006, 146 (1) : 3 - 18
[29] DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING TREES.
Dalal, Yogen K.
IEEE Transactions on Software Engineering, 1987, SE-13 (03) : 398 - 405
[30] MINIMAL SPANNING TREES SUBJECT TO DISJOINT ARC SET CONSTRAINTS
SUURBALLE, JW
OPERATIONS RESEARCH, 1975, 23 : B357 - B357

← 1 2 3 4 5 →