FINDING THE K SMALLEST SPANNING-TREES

被引：0

|

作者：

EPPSTEIN, D

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1990年 / 447卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：38 / 47

页数：10

相关论文

共 50 条

[1] FINDING THE K-SMALLEST SPANNING-TREES
EPPSTEIN, D
[J]. BIT, 1992, 32 (02): : 237 - 248
[2] AN ALGORITHM FOR FINDING K-MINIMUM SPANNING-TREES
KATOH, N
IBARAKI, T
MINE, H
[J]. SIAM JOURNAL ON COMPUTING, 1981, 10 (02) : 247 - 255
[3] ON FINDING MOST UNIFORM SPANNING-TREES
GALIL, Z
SCHIEBER, B
[J]. DISCRETE APPLIED MATHEMATICS, 1988, 20 (02) : 173 - 175
[4] FINDING THE GRAPH WITH THE MAXIMUM NUMBER OF SPANNING-TREES
MOUSTAKIDES, G
BEDROSIAN, SD
[J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1980, 310 (06): : 343 - 348
[5] ON THE COMPLEXITY OF FINDING MULTI-CONSTRAINED SPANNING-TREES
CAMERINI, PM
GALBIATI, G
MAFFIOLI, F
[J]. DISCRETE APPLIED MATHEMATICS, 1983, 5 (01) : 39 - 50
[6] FINDING MINIMAL SPANNING-TREES IN A EUCLIDEAN COORDINATE SPACE
NEVALAINEN, O
ERNVALL, J
KATAJAINEN, J
[J]. BIT, 1981, 21 (01): : 46 - 54
[7] ALGORITHM FOR FINDING THE COMMON SPANNING-TREES OF 2 GRAPHS
GRIMBLEBY, JB
[J]. ELECTRONICS LETTERS, 1981, 17 (13) : 470 - 471
[8] STRUCTURED SPANNING-TREES
ANCONA, M
DEFLORIANI, I
DEOGUN, JS
[J]. COMPUTER JOURNAL, 1990, 33 (04): : 344 - 355
[9] ON FINDING OPTIMAL AND NEAR-OPTIMAL LINEAL SPANNING-TREES
FELLOWS, MR
FRIESEN, DK
LANGSTON, MA
[J]. ALGORITHMICA, 1988, 3 (04) : 549 - 560
[10] FINDING THE MOST VITAL EDGES WITH RESPECT TO THE NUMBER OF SPANNING-TREES
TSEN, FSP
SUNG, TY
LIN, MY
HSU, LH
MYRVOLD, W
[J]. IEEE TRANSACTIONS ON RELIABILITY, 1994, 43 (04) : 600 - 603

← 1 2 3 4 5 →