Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning tree. We show in this paper that if G is sufficiently highly edge connected then the expected length of a minimum spanning tree is ∼ nr ζ(3). If we omit the edge connectivity condition, then it is at most ∼ nr (ζ(3) +...

This paper aimed to present a new method for the spectral-spatial classification of hyperspectral images, based on the idea of modified minimum spanning forest (MMSF). MMSF works on the obtained regions of pre-segmentation step that are considered as nodes of an image graph. In the proposed method, the image is first smoothed by the multiscale edge-preserving filter (MSEPF) and then the MMSF is...

In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spanning tree approaches, is deterministic but proves simpler, faster and doesn’t require to set in advance a value for k, the number of clusters.

The information content of the minimum spanning tree (MST), used to capture higher-order statistics and from cosmic web, is compared that power spectrum for a $\nu\Lambda$CDM model. measurements are made in redshift space using haloes Quijote simulation mass $\geq 3.2\times 10^{13}\,h^{-1}{\rm M}_{\odot}$ box length $L_{\rm box}=1\,h^{-1}{\rm Gpc}$. multipoles (monopole quadrupole) computed Fou...

Visualizing the human brain using diffusion tensor magnetic resonance imaging (DT-MRI) data has been a key technique to study the structure of the human brain and its connectivity. The challenge is to find a method that best exploits the data and serves as a model for visualization and connectivity analysis. This paper presents a novel method of visualizing the human brain structure with a mini...

This paper proposes an approach for the reconstruction of itineraries extracted from narrative texts. This approach is divided into two main tasks. The first extracts geographical information with natural language processing. Its outputs are annotations of so called expanded entities and expressions of displacement or perception from hiking descriptions. In order to reconstruct a plausible foot...

Minimum Spanning Trees (MSTs) are ubiquitous in optimization problems in networks. Even though fast algorithms exist to solve the MST problem, real world applications are usually subject to constraints that do not let us apply such methods directly. In these cases we confront a version of the MST called the “Weighted Spanning Tree” (WST) in which we look for a spanning tree in a graph that sati...

This paper presents a lower bound of Ω(D+ √ n/ logn) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in weighted n-vertex networks of diameter D = Ω(logn), in the bounded message model. This establishes the asymptotic nearoptimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D + √ n log∗ n).