Results 71 to 80 of about 3,689,343 (292)
Advanced Functional Materials, EarlyView.This work presents a closed‐loop optimization workflow integrating CatBot, an automated synthesis and testing system, to discover NiMo hydrogen‐evolution catalysts. CatBot synthesised and evaluated 228 unique samples, identifying the best performing catalysts for transfer to nickel‐foam electrodes. The best candidate is highly active, reaching 1 Acm−2${
Paolo Vincenzo Freiesleben de Blasio +7 more
wiley +1 more source
Minimum Spanning Tree for the Implementation of Kruskal’s Algorithm
IJID (International Journal on Informatics for Development), 2014 Kruskal’s algorithm is an algorithm used to find a minimum spanning tree in graph connectivity which gives an option to keep processing the edge limit with the least weight.
Paryati Paryati, Ahmad Subhan Yazid
doaj +1 more source
A fair rule in minimum cost spanning tree problems [PDF]
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature.
Gustavo Bergantiños, Juan Vidal-Puga
core
Biodegradable 3D‐Printable and Coatable Antifouling Composites for Marine Applications
Advanced Functional Materials, EarlyView.Marine biofouling damages submerged surfaces and raises greenhouse gas emissions. Biodegradable antifouling biocomposites were developed by hot‐mixing beeswax, Tween 80, and calcium stearate or stearic acid. Adjusting the component ratio enables processing via hot‐pressing, 3D‐printing, or dip‐coating.
Gabriele Corigliano +17 more
wiley +1 more source
Unified Pressure and Field Response Across Distinct Charge‐Order Regimes in Ti‐Doped CsV3Sb5
Advanced Functional Materials, EarlyView.We microscopically investigate the interplay between charge order and superconductivity in a kagome superconductor across regimes of long‐ and short‐range charge order. Hydrostatic‐pressure and magnetic‐field μSR$\mu{\rm SR}$ measurements reveal remarkably similar superconducting and normal‐state time‐reversal‐symmetry‐breaking responses in both ...
P. Kral +12 more
wiley +1 more source
Spanning trees with small diameters
AKCE International Journal of Graphs and Combinatorics, 2020 A spanning tree with small diameter of a graph has many applications. In this paper we first make the following conjecture and show that the condition is best possible if it is true. If a connected graph satisfies , then has a spanning tree with diameter
Mikio Kano, Hajime Matsumura
doaj +1 more source
Additivity in cost spanning tree problems [PDF]
We characterize a rule in cost spanning tree problems using an additivity property and some basic properties. If the set of possible agents has at least three agents, these basic properties are symmetry and separability. If the set of possible agents has
Gustavo Bergantiños, Juan Vidal-Puga
core
Advanced Functional Materials, EarlyView.Here, we establish a low‐dose liquid‐phase electron microscopy workflow for real‐time observation of biological processes in hydrated conditions. Beam damage is reduced by imaging only 20% of the pixels and reconstructing the complete image using an inpainting algorithm.
Luco Rutten +7 more
wiley +1 more source
The Budgeted Labeled Minimum Spanning Tree Problem
MathematicsIn order to reduce complexity when designing multi-media communication networks, researchers often consider spanning tree problems defined on edge-labeled graphs.
Raffaele Cerulli +3 more
doaj +1 more source
An Edge-Swap Heuristic for Finding Dense Spanning Trees
Theory and Applications of Graphs, 2016 Finding spanning trees under various restrictions has been an interesting question to researchers. A "dense" tree, from a graph theoretical point of view, has small total distances between vertices and large number of substructures.
Mustafa Ozen +3 more
doaj +1 more source