Results 121 to 130 of about 248,790 (377)
Heuristics based on greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem [PDF]
, 2007 This paper studies heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree using edges that are as similar as possible.
Consoli, S +3 more
core
An O(1)-Approximation for Minimum Spanning Tree Interdiction
, 2015 Network interdiction problems are a natural way to study the sensitivity of a network optimization problem with respect to the removal of a limited set of edges or vertices.
Zenklusen, Rico
core +1 more source
Spin Engineering of Dual‐Atom Site Catalysts for Efficient Electrochemical Energy Conversion
Advanced Materials, EarlyView.This review highlights recent progress in spin engineering of dual‐atom site catalysts (DASCs), emphasizing how spin‐related properties enhance electrocatalytic activity, selectivity, and stability. It summarizes cutting‐edge developments in dual‐atom catalysis, discusses the underlying spin‐catalysis mechanisms and structure–performance relationships,
Dongping Xue +5 more
wiley +1 more source
Minimum Monotone Spanning Trees
To appear in Proc. 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025)
Emilio Di Giacomo +5 more
openaire +2 more sources
Negligence Minimum Spanning Tree Algorithm
European Journal of Science and Technology, 2018 In the life, we always aim to do anything with the less cost considering time and distance. In graph theory, finding a minimum weight (cost or path) is a well-known problem. A minimum spanning tree is one of the methods brought for this purpose. In this work, we consider a negligence algorithm to find a minimum spanning tree
SAYLI, Ayla, ALKHALİSSİ, Jumana H.s.
openaire +3 more sources
Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application
Advanced Materials, EarlyView.This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong +12 more
wiley +1 more source
Average Case Analysis of the MST-heuristic for the Power Assignment Problem: Special Cases
EAI Endorsed Transactions on Energy Web, 2016 We present an average case analysis of the minimum spanning tree heuristic for the power assignment problem. The worst-case approximation ratio of this heuristic is 2.
Maurits de Graaf +3 more
doaj +1 more source
Minimum Spanning trees with Neighborhoods
, 2016 26 pages, 4 figures, 7 ...
Blanco, Víctor +2 more
openaire +2 more sources
AI‐Driven Defect Engineering for Advanced Thermoelectric Materials
Advanced Materials, EarlyView.This review presents how AI accelerates the design of defect‐tuned thermoelectric materials. By integrating machine learning with high‐throughput data and physics‐informed representations, it enables efficient prediction of thermoelectric performance from complex defect landscapes.
Chu‐Liang Fu +9 more
wiley +1 more source
Computing minimum spanning trees efficiently [PDF]
, 1972 A. Kershenbaum, R. Van Slyke
openalex +1 more source