A NOTE ON FINDING SHORTEST-PATH TREES

被引：9

|

作者：

KERSHENBAUM, A

机构：

来源：

NETWORKS | 1981年 / 11卷 / 04期

关键词：

D O I：

10.1002/net.3230110410

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：399 / 400

页数：2

相关论文

共 50 条

[1] A NOTE ON THE CONSTRAINED SHORTEST-PATH PROBLEM
PUJARI, AK
AGARWAL, S
GULATI, VP
[J]. NAVAL RESEARCH LOGISTICS, 1984, 31 (01) : 87 - 89
[2] A NOTE ON THE PARTITIONING SHORTEST-PATH ALGORITHM
DESROCHERS, M
[J]. OPERATIONS RESEARCH LETTERS, 1987, 6 (04) : 183 - 187
[3] NOTE ON THE SHORTEST-PATH PROBLEM - REPLY
ROMANI, F
[J]. INFORMATION PROCESSING LETTERS, 1981, 13 (02) : 87 - 87
[4] Indexing Network Structure with Shortest-Path Trees
Maier, Marc
Rattigan, Matthew
Jensen, David
[J]. ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2011, 5 (03)
[5] CONSTRUCTION OF CENTERED SHORTEST-PATH TREES IN NETWORKS
WALL, DW
OWICKI, S
[J]. NETWORKS, 1983, 13 (02) : 207 - 231
[6] BALANCING MINIMUM SPANNING-TREES AND SHORTEST-PATH TREES
KHULLER, S
RAGHAVACHARI, B
YOUNG, N
[J]. ALGORITHMICA, 1995, 14 (04) : 305 - 321
[7] AN AMELIORATION OF THE DIJKSTRA METHOD FOR FINDING THE SHORTEST-PATH IN A NETWORK
BOVET, J
[J]. DISCRETE APPLIED MATHEMATICS, 1986, 13 (01) : 93 - 96
[8] Fault-Tolerant Approximate Shortest-Path Trees
Bilo, Davide
Guala, Luciano
Leucci, Stefano
Proietti, Guido
[J]. ALGORITHMS - ESA 2014, 2014, 8737 : 137 - 148
[9] A SHORTEST-PATH METRIC ON UNLABELED BINARY-TREES
BONNIN, A
PALLO, JM
[J]. PATTERN RECOGNITION LETTERS, 1992, 13 (06) : 411 - 415
[10] PROPERTIES OF LABELING METHODS FOR DETERMINING SHORTEST-PATH TREES
SHIER, DR
WITZGALL, C
[J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS, 1981, 86 (03): : 317 - 330

← 1 2 3 4 5 →