Results 131 to 140 of about 248,790 (377)
Advanced Materials, EarlyView.High‐entropy materials (HEMs), typically composed of five or more principal elements in near‐equimolar ratios, offer significant potential due to their unique properties. This review outlines the emergence and structural evolution of HEMs, followed by an in‐depth discussion of the elemental roles (active sites, promoters, or stabilizers) for water ...
Yufei Zhao +9 more
wiley +1 more source
Algorithm 42. Enclosure of a point to the minimum spanning tree [PDF]
, 1976 G. Trybuś
openalex +1 more source
Outlier detection using iterative adaptive mini-minimum spanning tree generation with applications on medical data. [PDF]
Front Physiol, 2023 Li J +5 more
europepmc +1 more source
Euclidean minimum spanning trees and bichromatic closest pairs [PDF]
, 1991 Pankaj K. Agarwal +3 more
openalex +1 more source
Advanced Materials Interfaces, EarlyView.Detecting single molecules on large interfaces is challenging due to minimal perturbations on the sensing surface. Some biological systems achieve this feat using amplification mechanisms, but their molecular foundations remain unclear. To investigate, a Design of Experiments (DoE) approach examines how pH and ionic strength in conditioning solutions ...
Michele Catacchio +9 more
wiley +1 more source
Dynamic minimum spanning tree construction and maintenance for Wireless Sensor Networks
Revista Facultad de Ingeniería Universidad de Antioquia, 2019 In a Wireless Sensor Network (WSN), finding the optimal route from each node to the sink is not a straightforward task because of the distributed and dynamic characteristics of the network.
Sergio Diaz, Diego Mendez
doaj +1 more source
A Clustering-Enhanced Memetic Algorithm for the Quadratic Minimum Spanning Tree Problem. [PDF]
Entropy (Basel), 2022 Zhang S, Mao J, Wang N, Li D, Ju C.
europepmc +1 more source
An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability [PDF]
, 1990 Dimitris Bertsimas, Garrett van Ryzin
openalex +1 more source
A greedy heuristic for the capacitated minimum spanning tree problem
Journal of the Operational Research Society, 2017 This paper develops a greedy heuristic for the capacitated minimum spanning tree problem (CMSTP), based on the two widely known methods of Prim and of Esau–Williams.
Manolis N. Kritikos, G. Ioannou
semanticscholar +1 more source
Cost monotonicity, consistency and minimum cost spanning tree games [PDF]
, 2002 We propose a new cost allocation rule for minimum cost spanning tree games. The new rule is a core selection and also satisfies cost monotonicity. We also give characterization theorems for the new rule as well as the much-studied Bird allocation.
Dutta, Bhaskar, Kar, Anirban
core +1 more source