Results 81 to 90 of about 49,235 (305)
Advanced Healthcare Materials, EarlyView.Surface‐host dialogue at the implant interface governs biological fate and osseointegration. Surface physicochemical properties of titanium (Ti) dental implants, including microgrooves, nanopatterns, nanotopography, roughness, and wettability, modulate the initial adsorption of proteins and the formation of a dynamic biointerface.
Daniela Moreira Cunha +9 more
wiley +1 more source
Minimum spanning tree reconstruction using autoencoders [PDF]
, 2022 Minimum spanning trees are widely used graph structures used to find relationships between data organized in a graph. This work proposes a new approach based on neural networks, in particular, autoencoders, to extrapolate this tree from the dissimilarity
Castelletto, Riccardo
core
Computing Well-Balanced Spanning Trees of Unweighted Networks
AlgorithmsA spanning tree of a network or graph is a subgraph that connects all nodes with the minimum number or total weight of edges. Spanning trees are among the simplest yet most effective techniques for network simplification, sampling, and uncovering a ...
Lovro Šubelj
doaj +1 more source
Spanning trees for many different numbers of leaves [PDF]
Discrete Mathematics & Theoretical Computer ScienceLet $G$ be a connected graph and $L(G)$ the set of all integers $k$ such that $G$ contains a spanning tree with exactly $k$ leaves. We show that for a connected graph $G$, the set $L(G)$ is contiguous.
Kenta Noguchi, Carol T. Zamfirescu
doaj +1 more source
Advanced Materials, EarlyView.Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu +3 more
wiley +1 more source
Spanning trees homeomorphic to a small tree
Discrete Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Akira Saito, Kazuki Sano
openaire +1 more source
Measuring the Hall Effect in Hysteretic Materials
Advanced 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
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
Advanced Materials, EarlyView.We introduce a computational workflow that combines quantum chemical calculations and machine learning techniques to predict the catalytic performance of a wide range of catalysts in the nitrogen reduction reaction (NRR). The analysis of the trained models provides insights into the complex structure–activity relationship in experimental catalytic ...
Leonardo Di Ciano +5 more
wiley +1 more source
Discrete Mathematics, 1992 The author deals with infinite graphs. R. Halin defined an end \(E\) of an infinite graph \(G\) as a set of 1-way infinite paths in \(G\) such that vertices \(P\) and \(Q\) are in \(E\) iff for any subset \(R\) of the vertice set there is a finite path in \(G-R\) joining \(P\) and \(Q\). The author proves that if \(T\) is a locally finite spanning tree
openaire +2 more sources