GOOD ALGORITHM FOR SMALLEST SPANNING TREES WITH A DEGREE CONSTRAINT

被引：31

|

作者：

GABOW, HN

机构：

来源：

NETWORKS | 1978年 / 8卷 / 03期

关键词：

D O I：

10.1002/net.3230080304

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

收藏

页码：201 / 208

页数：8

相关论文

共 50 条

[21] Minimum Bottleneck Spanning Trees with Degree Bounds
Andersen, Patrick J.
Ras, Charl J.
NETWORKS, 2016, 68 (04) : 302 - 314
[22] The distribution of node degree in maximum spanning trees
Willemain, TR
Bennett, MV
JOURNAL OF STATISTICAL COMPUTATION AND SIMULATION, 2002, 72 (02) : 101 - 106
[23] Average distance, minimum degree, and spanning trees
Dankelmann, P
Entringer, R
JOURNAL OF GRAPH THEORY, 2000, 33 (01) : 1 - 13
[24] A note on spanning trees with a specified degree sequence
Elena Martinez-Cuero, Maria
Rivera-Campo, Eduardo
BOLETIN DE LA SOCIEDAD MATEMATICA MEXICANA, 2020, 26 (02): : 241 - 245
[25] Degree condition for completely independent spanning trees
Hong, Xia
Liu, Qinghai
INFORMATION PROCESSING LETTERS, 2016, 116 (10) : 644 - 648
[26] A note on spanning trees with a specified degree sequence
María Elena Martínez-Cuero
Eduardo Rivera-Campo
Boletín de la Sociedad Matemática Mexicana, 2020, 26 : 241 - 245
[27] THE SMALLEST HARMONIC INDEX OF TREES WITH GIVEN MAXIMUM DEGREE
Rasi, Reza
Sheikholeslami, Seyed Mahmoud
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (02) : 499 - 513
[28] TREE-WEIGHTED NEIGHBORS AND GEOMETRIC k SMALLEST SPANNING TREES
Eppstein, David
INTERNATIONAL JOURNAL OF COMPUTATIONAL GEOMETRY & APPLICATIONS, 1994, 4 (02) : 229 - 238
[29] AN ALGORITHM FOR THE ENUMERATION OF SPANNING-TREES
WINTER, P
BIT, 1986, 26 (01): : 44 - 62
[30] ALGORITHM FOR THE ENUMERATION OF SPANNING TREES.
Winter, Pawel
BIT (Copenhagen), 1986, 26 (01): : 44 - 62

← 1 2 3 4 5 →