Two approaches for the min-degree constrained minimum spanning tree problem-Reference-Cited by-同舟云学术

Two approaches for the min-degree constrained minimum spanning tree problem

Published:2021-11 Issue: Volume:111 Page:107715
ISSN:1568-4946
Container-title:Applied Soft Computing
language:en
Short-container-title:Applied Soft Computing

Author:

Ghoshal Sudishna,Sundar Shyam

Publisher

Elsevier BV

Subject

Software

Reference39 articles.

1. A new evolutionary approach to the degree-constrained minimum spanning tree problem;Knowles;IEEE Trans. Evol. Comput.,2000

2. G.R. Raidl, B.A. Julstrom, A weighted coding in a genetic algorithm for the degree-constrained minimum spanning tree problem, in: Applied Computing 2000, Proceedings of the 2000 ACM Symposium on Applied Computing, Villa Olmo, Via Cantoni 1, 22100 Como, Italy, March 19–21, 2000, Vol. 1, 2000, pp. 440–445.

3. Edge exchanges in the degree constrained minimum spanning tree problem;Savelsbergh;Comput. Oper. Res.,1985

4. Relations, models and a memetic approach for three degree-dependent spanning tree problems;Cerrone;European J. Oper. Res.,2014

5. L. Gargano, P. Hell, L. Stacho, U. Vaccaro, Spanning trees with bounded number of branch vertices, in: Proceedings of 29th International Colloquium, Vol. 2380, ICALP 2002 Malaga, Spain, 2002, pp. 355–365.

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

1. An artificial bee colony algorithm for the minimum edge-dilation K-center problem;Soft Computing;2024-07

2. A Hybrid Artificial Bee Colony Algorithm for the Degree-Constrained Minimum Spanning Tree Problem;Lecture Notes in Electrical Engineering;2023

3. Optimal Terminal Interconnection Reconstruction along with Terminal Transition in Randomly Divided Planes;Journal of information and communication convergence engineering;2022-09-30

4. Heuristic Network Security Risk Assessment Based on Attack Graph;Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2022