Results 31 to 40 of about 43,946 (309)
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Minimum Spanning Trees on Random Networks [PDF]
Physical Review Letters, 2001 Physical Review ...
Dobrin, R., Duxbury, P. M.
openaire +3 more sources
Extensions of the minimum labelling spanning tree problem
Journal of Telecommunications and Information Technology, 2006 In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic
Raffaele Cerulli +2 more
doaj +1 more source
Pruning a minimum spanning tree [PDF]
Physica A: Statistical Mechanics and its Applications, 2012 This work employs some techniques in order to filter random noise from the information provided by minimum spanning trees obtained from the correlation matrices of international stock market indices prior to and during times of crisis. The first technique establishes a threshold above which connections are considered affected by noise, based on the ...
openaire +2 more sources
On Sorting, Heaps, and Minimum Spanning Trees [PDF]
Algorithmica, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gonzalo Navarro 0001, Rodrigo Paredes
openaire +4 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
Geo-MST: A geographical minimum spanning tree plugin for QGIS
SoftwareX, 2020 Graphs describing the relation between nodes and edges are common in geographic information science. One of the algorithms that operate on graphs is ‘Minimum Spanning Tree (MST)’, which is a tree that connects all the nodes of a graph with minimum cost ...
Murat Çalışkan, Berk Anbaroğlu
doaj +1 more source
Bounded-Angle Minimum Spanning Trees
Algorithmica, 2021 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ahmad Biniaz +3 more
openaire +3 more sources
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
On the probabilistic min spanning tree Problem [PDF]
, 2010 International audienceWe study a probabilistic optimization model for min spanning tree, where any vertex v i of the input-graph G(V, E) has some presence probability p i in the final instance G′ ⊂ G that will effectively be optimized.
Paschos, V.T. +10 more
core +1 more source