UNRANKING AND RANKING SPANNING-TREES OF A GRAPH

被引：21

作者：

COLBOURN, CJ

DAY, RPJ

NEL, LD

机构：

[1] UNIV WATERLOO,DEPT COMBINATOR & OPTIMIZAT,WATERLOO N2L 3G1,ONTARIO,CANADA

[2] UNIV WATERLOO,DEPT COMP SCI,WATERLOO N2L 3G1,ONTARIO,CANADA

来源：

关键词：

D O I：

10.1016/0196-6774(89)90016-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：271 / 286

页数：16

共 12 条

[1] COLBOURN CJ, 1987, IN PRESS 17TH P MAN
[2] Feussner W, 1904, ANN PHYS-BERLIN, V15, P385
[3] Feussner W, 1902, ANN PHYS-BERLIN, V9, P1304
[4] RANDOM SPANNING TREE
GUENOCHE, A
[J]. JOURNAL OF ALGORITHMS, 1983, 4 (03) : 214 - 220
[5] Katona G., 1966, THEORY GRAPHS, P187
[6] Kirchhoff G., 1958, IRE T CIRCUIT THEORY, V5, P4, DOI /10.1109 / TCT.1958.1086426
[7] Kirchhoff G., 1847, ANN PHYS-NEW YORK, V72, P497, DOI [10.1002/andp.18471481202, DOI 10.1002/ANDP.18471481202]
[8] NUMBERING SYSTEM FOR BINARY TREES
KNOTT, GD
[J]. COMMUNICATIONS OF THE ACM, 1977, 20 (02) : 113 - 115
[9] Kruskal J. B., 1963, MATH OPTIMIZATION TE, P251
[10] KULKARNI VG, 1985, UNCORSATR851 U N CAR