Advanced Materials, EarlyView.Water harvesting, radiative cooling, and interfacial solar evaporation are fundamentally governed by coupled heat, mass, and light transport processes. These processes are mediated by pore architecture, including pore size, connectivity, and hierarchical organization.
Dejan J. Trajkovski +5 more
wiley +1 more source
Solving the minimum labelling spanning tree problem using hybrid local search [PDF]
, 2007 Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours).
Moreno-Perez, J A +3 more
core +3 more sources
Using a Significant Spanning Tree to Draw a Directed Graph
Journal of Graph Algorithms and Applications, 2008 A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for ...
Martin Harrigan, Patrick Healy
doaj +1 more source
Minimum Cost Spanning Tree Games and Population Monotonic Allocation Schemes [PDF]
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost spanning tree game a population monotonic allocation scheme.As a basis for this algorithm serves a decomposition theorem that shows that every minimum cost ...
Moretti, S., Tijs, S.H., Norde, H.W.
core
Single‐Particle FRET Probes Heterogeneity in the Ligand Shell of Colloidal Perovskite Quantum Dots
Advanced Materials, EarlyView.Single‐particle, single‐molecule Förster resonance energy transfer turns dye‐tagged ligands into nanorulers for the otherwise elusive organic shell of CsPbBr3 quantum dots. Distance variations within individual particles reveal pronounced local heterogeneity, while changes in the surrounding ligand chemistry shift the average dye–surface separation ...
Leon G. Feld +6 more
wiley +1 more source
Realizing efficient outcomes in cost spanning problems [PDF]
We propose a simple non-cooperative mechanism of network formation in cost spanning tree problems. The only subgame equilibrium payoff is efficient. Moreover, we extend the result to the case of budget restrictions.
Gustavo Bergantiños, Juan Vidal-Puga
core
Achieving High Spatial Resolution Transmission Electron Microscopy Studies in Closed Liquid Cells
Advanced Materials, EarlyView.Achieving high spatial resolution is important for resolving nanoscale dynamic processes and structural transformations in liquid environments, yet remains challenging in liquid cell transmission electron microscopy (LCTEM). This review highlights key strategies, including mitigating membrane bulging, displacing or redistributing local liquid ...
Siqi Guo +9 more
wiley +1 more source
Polynomial Time Approximation Schemes for the Constrained Minimum Spanning Tree Problem
Journal of Applied Mathematics, 2012 Let G=(V,E) be an undirected graph with a weight function and a cost function on edges. The constrained minimum spanning tree problem is to find a minimum cost spanning tree T in G such that the total weight in T is at most a given bound B. In this paper,
Yen Hung Chen
doaj +1 more source
Extensions of the minimum labelling spanning tree problem
Journal of Telecommunications and Information Technology, 2006 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
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]
Data Brief, 2023 Carvalho IA, Coco AA.
europepmc +1 more source