Journal Article10.1016/J.ENDM.2016.05.029
An Algorithm for kth Minimum Spanning Tree
Amal P M,Ajish Kumar K S +1 more
5
TL;DR: This algorithm is used to solve degree constrained minimum spanning tree problem, an NP-complete problem, with exponential time complexity.
read more
About: This article is published in Electronic Notes in Discrete Mathematics. The article was published on 01 Sep 2016. The article focuses on the topics: Spanning tree & Minimum spanning tree.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Parallelizing computations of full disjunctions
TL;DR: This paper introduces a novel approach parafd, based on parallel computing techniques, for implementing the full disjunction operator in an exact and approximate version, and shows that the time performance outperforms existing approaches.
A time-varying neural network for solving minimum spanning tree problem on time-varying network
TL;DR: Wang et al. as mentioned in this paper proposed a time-varying neural network (TVNN) for solving the TNMSTP, which can achieve parallel computing without any training requirements.
1
PENENTUAN POHON PERENTANG MINIMUM KE-k DENGAN MENGGUNAKAN ALGORITMA k-MST
TL;DR: Penentuan MST ke-k dengan Algoritma k-MST menghasilkan satu MST dengan bobot terkecil dan satu MST dengan bobot terbesar yang sesuai dengan kebutuhan.
High-uniformity liquid-cooling network designing approach for energy storage systems by graph-coupled genetic algorithm
Huaiyu Zuo,Jiacheng Han,Songxue Chi,Zhaochen Wang,Jiajia Wang,Run Hu,Wei Ma,Xiaobing Luo +7 more
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
On the shortest spanning subtree of a graph and the traveling salesman problem
Joseph B. Kruskal
- 01 Feb 1956
TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Shortest connection networks and some generalizations
TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
4.9K
Two Algorithms for Generating Weighted Spanning Trees in Order
TL;DR: In this paper, two algorithms for generating spanning trees of a connected graph in order of increasing weight are presented, where the running time is O(K + K + E) and the space is O (K + E).
154