Results 21 to 30 of about 133,936 (292)
Minimum vertex degree conditions for loose spanning trees in 3-graphs
Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications, 2023 In 1995, Koml\'os, S\'ark\"ozy and Szemer\'edi showed that for large $n$, every $n$-vertex graph with minimum degree at least $(1/2 + \gamma)n$ contains all spanning trees of bounded degree. We consider a generalization of this result to loose spanning hypertrees, that is, linear hypergraphs obtained by successively appending edges sharing a single ...
Pehova, Yanitsa, Petrova, Kalina
openaire +2 more sources
The Directed Minimum-Degree Spanning Tree Problem [PDF]
, 2001 Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V. The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is the smallest among all such spanning trees. The problem is known to be NP-hard. A quasi-polynomial time approximation algorithm for this problem is presented.
Radha Krishnan, Balaji Raghavachari
openaire +1 more source
On Generalizations of Network Design Problems with Degree Bounds [PDF]
, 2009 Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling ...
A. Frank +15 more
core +3 more sources
Portfolio Optimization Using Minimum Spanning Tree Model in the Moroccan Stock Exchange Market
International Journal of Financial Studies, 2023 Portfolio optimization is a pertinent topic of significant importance in the financial literature. During the portfolio construction, an investor confronts two important steps: portfolio selection and portfolio allocation.
Younes Berouaga +2 more
doaj +1 more source
The impact of COVID-19 on cryptocurrency markets: A network analysis based on mutual information.
PLoS ONE, 2022 The purpose of our study is to figure out the transitions of the cryptocurrency market due to the outbreak of COVID-19 through network analysis, and we studied the complexity of the market from different perspectives.
Mi Yeon Hong, Ji Won Yoon
doaj +2 more sources
Clustering of online learning resources via minimum spanning tree [PDF]
AAOU Journal, 2016 Purpose - The quick growth of web-based and mobile e-learning applications such as massive open online courses have created a large volume of online learning resources.
Qingyuan Wu +4 more
doaj +1 more source
On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k
Discussiones Mathematicae Graph Theory, 2015 A k-tree is a tree with maximum degree at most k. In this paper, we give a degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than k.
Matsumura Hajime
doaj +1 more source
Degree sums and dense spanning trees.
PLoS ONE, 2017 Finding dense spanning trees (DST) in unweighted graphs is a variation of the well studied minimum spanning tree problem (MST). We utilize established mathematical properties of extremal structures with the minimum sum of distances between vertices to ...
Tao Li +3 more
doaj +1 more source
Minimum-Spanning-Tree-Based Time Delay Estimation Robust to Outliers
IEEE Access, 2023 In this paper, we present a novel approach to estimating multiple time delays (TDs) in sensor arrays that is robust to outliers of TD measurements. These measurements are typically obtained from the peak of the cross correlation of two sensor signals but
Kouei Yamaoka +3 more
doaj +1 more source
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident.
Han-Suk Sohn, Dennis Bricker
doaj