Results 91 to 100 of about 3,689,343 (292)

Spanning Trees whose Stems have a Bounded Number of Branch Vertices

open access: yesDiscussiones Mathematicae Graph Theory, 2016
Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T).
Yan Zheng
doaj   +1 more source

The Bird Core for Minimum Cost Spanning Tree problems Revisited: Monotonicity and Additivity Aspects [PDF]

open access: yes
A new way is presented to define for minimum cost spanning tree (mcst-) games the irreducible core, which is introduced by Bird in 1976.The Bird core correspondence turns out to have interesting monotonicity and additivity properties and each stable cost
Moretti, S.   +3 more
core  

Thermodynamic Limits to Molecular Doping in Conjugated Polymers: A Perspective on Phase Behavior and Miscibility

open access: yesAdvanced Materials, EarlyView.
Molecular doping of conjugated polymers is fundamentally constrained by thermodynamic phase behavior. This Perspective reframes doping efficiency and stability in terms of miscibility limits, binodals, and solvus boundaries, highlighting the role of effective interaction parameters and charge transfer.
Somayeh Kashani   +10 more
wiley   +1 more source

Organic Materials of Tomorrow: Horizons of Artificial Intelligence

open access: yesAdvanced Materials, EarlyView.
This review examines machine learning techniques accelerating the discovery of organic semiconductors by linking molecular structure to properties. Key methods include graph neural networks, generative models, and active learning. Applications to organic photovoltaics demonstrate practical impact.
Harold Mena   +3 more
wiley   +1 more source

An Approximation Scheme for the Generalized Geometric Minimum Spanning Tree Problem with Grid Clustering [PDF]

open access: yes
This paper is concerned with a special case of the Generalized Minimum Spanning Tree Problem. The Generalized Minimum Spanning Tree Problem is de¯ned on an undirected graph, where the vertex set is partitioned into clusters, and non-negative costs are ...
Grigoriev,Alexander, Feremans,Corinne
core  

Measuring the Hall Effect in Hysteretic Materials

open access: yesAdvanced Materials, EarlyView.
The authors highlight common pitfalls in measuring the Hall effect: in hysteretic magnets, improper data processing can create signals that look exotic but are not real. This Perspective explains the origin of these artifacts and presents practical measurement strategies that help researchers identify reliable Hall responses in complex magnetic ...
Jaime M. Moya   +6 more
wiley   +1 more source

Phase‐Pure and Size‐Tunable Tin Halide Perovskite Quantum Dots

open access: yesAdvanced Materials, EarlyView.
A trioctylphosphine oxide modulated protocol allows for the synthesis and study of the optical properties of a broad library of tin halide perovskite quantum dots across multiple A‐ and X‐site compositions with precise size tuning while eliminating unwanted 2D phases.
Ole F. Dressler   +7 more
wiley   +1 more source

Efficient and Accurate Construction of Genetic Linkage Maps from the Minimum Spanning Tree of a Graph

open access: yesPLoS Genetics, 2008
Genetic linkage maps are cornerstones of a wide spectrum of biotechnology applications, including map-assisted breeding, association genetics, and map-assisted gene cloning.
Yong-Hui Wu   +3 more
semanticscholar   +1 more source

Breaking the Surface: Buoyant Metal–Polymer Open–Cell Hybrid Lattice Metamaterials

open access: yesAdvanced Materials, EarlyView.
Open‐cell metal–polymer lattice metamaterials that defy sinking. (a) Injection process of the polyurethane (PU) foam into the titanium (Ti‐6Al‐4V) hollow‐strut lattice creating the open‐cell Ti‐6Al‐4V+PU hybrid lattice, (b) flotation test of a hybrid lattice specimen, and (c) a digital representation and experimental validation of a marine buoy ...
Jordan Noronha   +7 more
wiley   +1 more source

Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs

open access: yesMathematics
This paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy