A good algorithm for smallest spanning trees with a degree constraint-Reference-Cited by-同舟云学术

A good algorithm for smallest spanning trees with a degree constraint

Published:1978 Issue:3 Volume:8 Page:201-208
ISSN:0028-3045
Container-title:Networks
language:en
Short-container-title:Networks

Author:

Gabow H. N.

Publisher

Wiley

Subject

Computer Networks and Communications,Hardware and Architecture,Information Systems,Software

Reference10 articles.

1. and , The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, Massachusetts, 1974.

2. Finding Minimum Spanning Trees

3. “Hu's Optimum Communication Spanning Tree Problem is NP-Complete,” unpublished memo.

4. and , “Finding Minimum Spanning Trees with a Fixed Number of Links at a Node,” Report No. 74-5, Research Report CS #169, Center for Cybernetic Studies, University of Texas at Austin, Austin, Texas, 1974.

5. Optimum Communication Spanning Trees

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Design of capacitated degree constrained min-sum arborescence;OPSEARCH;2022-06-27

2. On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane $${\mathbb {R}}^2$$;Optimization Letters;2020-08-10

3. Approaches to Solving Basic Problems of Closed Routes;2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET);2020-02

4. A New Crossover Algebra of GA for Solving the Degree Constrained Minimum Spanning Tree Problems;Journal of Physics: Conference Series;2019-04

5. An Algorithm for kth Minimum Spanning Tree;Electronic Notes in Discrete Mathematics;2016-09