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 条

[1] A DISTRIBUTED ALGORITHM FOR CONSTRUCTING MINIMAL SPANNING-TREES
DALAL, YK
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1987, 13 (03) : 398 - 405
[2] EFFICIENTLY SCANNING ALL SPANNING-TREES OF AN UNDIRECTED GRAPH
SHIOURA, A
TAMURA, A
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF JAPAN, 1995, 38 (03) : 331 - 344
[3] APPLICATION OF MINIMAL SPANNING-TREES IN GLIOMA GRADING - A CLIPPER PROGRAM FOR THE CALCULATION AND CONSTRUCTION OF MINIMAL SPANNING-TREES
KOLLES, H
LUDT, H
VINCE, GH
FEIDEN, W
COMPUTER METHODS AND PROGRAMS IN BIOMEDICINE, 1994, 42 (03) : 201 - 206
[4] ALGORITHMS FOR ENUMERATING ALL SPANNING-TREES OF UNDIRECTED AND WEIGHTED GRAPHS
KAPOOR, S
RAMESH, H
SIAM JOURNAL ON COMPUTING, 1995, 24 (02) : 247 - 265
[5] MINIMAL SPANNING-TREES, FILAMENTS AND GALAXY CLUSTERING
BARROW, JD
BHAVSAR, SP
SONODA, DH
MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 1985, 216 (01) : 17 - 35
[6] THE NUMBER OF SPANNING-TREES OF THE REGULAR NETWORKS
YANG, CS
WANG, JF
LEE, JY
BOESCH, FT
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1988, 23 (3-4) : 185 - 200
[7] ALGORITHMS FOR GENERATING ALL SPANNING-TREES OF UNDIRECTED, DIRECTED AND WEIGHTED GRAPHS
KAPOOR, S
RAMESH, H
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 519 : 461 - 472
[8] FINDING MINIMAL SPANNING-TREES IN A EUCLIDEAN COORDINATE SPACE
NEVALAINEN, O
ERNVALL, J
KATAJAINEN, J
BIT, 1981, 21 (01): : 46 - 54
[9] ESTIMATING THE LENGTH OF MINIMAL SPANNING-TREES IN COMPRESSION OF FILES
ERNVALL, J
NEVALAINEN, O
BIT, 1984, 24 (01): : 19 - 32
[10] ASYMPTOTICS FOR EUCLIDEAN MINIMAL SPANNING-TREES ON RANDOM POINTS
ALDOUS, D
STEELE, JM
PROBABILITY THEORY AND RELATED FIELDS, 1992, 92 (02) : 247 - 258

← 1 2 3 4 5 →