Results 131 to 140 of about 954,754 (291)
Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation [PDF]
This paper presents a robust branch-cut-and-price algorithm for the Capacitated Minimum Spanning Tree Problem (CMST). The variables are associated to q-arbs, a structure that arises from a relaxation of the capacitated prize-collecting arbores- cence ...
Pessoa, Artur +5 more
core
The number of spanning trees of cyclic snakes
A cyclic snake is a connected graph formed by connecting, by means of vertex amalgamation, a certain number of copies of the cycle Cn, in such a way that the i-th copy of Cn is connected with the (i+1)-th copy, resulting in a graph with maximum degree 4.
Christian Barrientos
doaj +1 more source
A physics‐informed property‐bridging framework links high‐throughput hardness screening to tensile performance in quenching and partitioning steels. By transferring metallurgically guided representations across properties, a single alloy composition is designed to achieve multiple strength grades through heat‐treatment tuning alone, offering a ...
Xiaolu Wei +7 more
wiley +1 more source
Depth functions and mutidimensional medians on minimal spanning trees. [PDF]
Yang M, Modarres R, Guo L.
europepmc +1 more source
Structured Spanning Trees [PDF]
Massimo Ancona +2 more
openaire +1 more source
A machine learning‐assisted framework optimizes the KCl‐CaCl2‐LiCl ternary electrolyte. The optimized 13:35:52 mol% composition enables Ca‐based liquid metal batteries to operate stably at 480 °C, with >99.5% coulombic efficiency, ultralow self‐discharge, and excellent cycling stability, advancing low‐temperature large‐scale energy storage.
Xinglin Zhou +3 more
wiley +1 more source
The Minimum Consistent Spanning Subset Problem on Trees
Given a vertex-colored edge-weighted graph, the minimum consistent subset (MCS) problem asks for a minimum subset $S$ of vertices such that every vertex $v\notin S$ has the same color as its nearest neighbor in $S$. This problem is NP-complete. A recent
Ahmad Biniaz, Parham Khamsepour
doaj +1 more source
EEG Functional Connectivity Underlying Emotional Valance and Arousal Using Minimum Spanning Trees. [PDF]
Cao R +8 more
europepmc +1 more source
Ratiometric dipyrene imaging resolves monomer (M) and excimer (E) channels and computes pixel‐wise E/M maps within biomolecular condensates, yielding physicochemical fingerprints shaped by coupled polarity‐related solvation and microviscosity. These spatial fingerprints enable quantitative phenotyping of cellular states, exemplified by separation of ...
Koki Matsumoto +20 more
wiley +1 more source
The Shapley value of phylogenetic trees [PDF]
Every weighted tree corresponds naturally to a cooperative game that we call a tree game; it assigns to each subset of leaves the sum of the weights of the minimal subtree spanned by those leaves.
Akemi Kashiwada +2 more
core

