Results 101 to 110 of about 309,634 (292)
Spanning tree size in Random Binary Search Trees
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal distribution.
Panholzer, Alois, Prodinger, Helmut
core +3 more sources
Embedding nearly spanning trees
Abstract The Erdős-Sós Conjecture states that every graph with average degree exceeding $k-1$ contains every tree with
Bruce Reed, Maya Stein
openaire +2 more sources
This review evaluates strategies for electrochemical CO2 reduction to ethylene, focusing on copper‐based catalyst design and microenvironment modulation to achieve industrial‐grade performance. By leveraging operando synchrotron‐based characterizations, we provide a multiscale understanding of dynamic structural transformations and key reaction ...
Meng Zhang, Zuolong Chen, Yimin A. Wu
wiley +1 more source
Visualisasi Efek Perubahan Fungsi Lahan Menggunakan Maksimum Spanning Tree dengan Pembobot Korelasi
This study aims to visualize the effect of land use change using Maximum Spanning Tree with correlation weight between variables. In addition to know the most dominant factors affect the dependent variable.
Dwi Risky Arifanti
doaj +1 more source
The radial spanning tree of a Poisson point process
We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root.
Baccelli, Francois, Bordenave, Charles
core +1 more source
Triplet‐Triplet Annihilation Enhances Photochemical Curing Contrast for Vat‐Based 3D Printing
Triplet–triplet annihilation photopolymerization (TTAP) resins enhance curing contrast for digital light processing (DLP) 3D printing compared to conventional Type I and II photopolymerizations at matched optical densities. By exploiting a superlinear initiation response, TTAP preserves fine details, allowing reliable fabrication of complex structures ...
Connor J. O'Dea +2 more
wiley +1 more source
Extensions of the minimum labelling spanning tree problem
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
Hyperbolic radial spanning tree
We define and analyze an extension to the $d$-dimensional hyperbolic space of the Radial Spanning Tree (RST) introduced by Baccelli and Bordenave in the two-dimensional Euclidean space (2007). In particular, we will focus on the description of the infinite branches of the tree.
Coupier, David +2 more
openaire +4 more sources
Computational Modeling Meets 3D Bioprinting: Emerging Synergies in Cardiovascular Disease Modeling
Emerging advances in three‐dimensional bioprinting and computational modeling are reshaping cardiovascular (CV) research by enabling more realistic, patient‐specific tissue platforms. This review surveys cutting‐edge approaches that merge biomimetic CV constructs with computational simulations to overcome the limitations of traditional models, improve ...
Tanmay Mukherjee +7 more
wiley +1 more source
Data, instance sets, and instances generator for the Hop-Constrained Minimum Spanning Tree problem, the Delay-Constrained Minimum Spanning Tree problem, and their bi-objective variants. [PDF]
Carvalho IA, Coco AA.
europepmc +1 more source

