Results 91 to 100 of about 2,238,100 (388)
Spanning trees with many leaves: new extremal results and an improved FPT algorithm [PDF]
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the ...
Bonsma, P.S.
core +2 more sources
On encodings of spanning trees
AbstractDeo and Micikevicius recently gave a new bijection for spanning trees of complete bipartite graphs. In this paper we devise a generalization of Deo and Micikevicius's method, which is also a modification of Olah's method for encoding the spanning trees of any complete multipartite graph K(n1,…,nr).
openaire +2 more sources
Beyond Order: Perspectives on Leveraging Machine Learning for Disordered Materials
This article explores how machine learning (ML) revolutionizes the study and design of disordered materials by uncovering hidden patterns, predicting properties, and optimizing multiscale structures. It highlights key advancements, including generative models, graph neural networks, and hybrid ML‐physics methods, addressing challenges like data ...
Hamidreza Yazdani Sarvestani +4 more
wiley +1 more source
A generalization of heterochromatic graphs
In 2006, Suzuki, and Akbari & Alipour independently presented a necessary and sufficient condition for edge-colored graphs to have a heterochromatic spanning tree, where a heterochromatic spanning tree is a spanning tree whose edges have distinct colors.
G. Hahn +7 more
core +1 more source
Ramsey Spanning Trees and Their Applications [PDF]
The metric Ramsey problem asks for the largest subset S of a metric space that can be embedded into an ultrametric (more generally into a Hilbert space) with a given distortion. Study of this problem was motivated as a non-linear version of Dvoretzky theorem.
Michael Elkin +4 more
openaire +4 more sources
Advancing Wildfire‐Retardant Materials: Engineering Strategies for Direct and Indirect Suppression
Here, the evolution, ecological impact, and performance of current fire‐retardant materials and suppression strategies are reviewed, offering an engineering perspective to address existing challenges and propose pathways for the development of more effective, scalable, and sustainable solutions to meet the demands of a changing climate. Wildfires cause
Changxin Dong +4 more
wiley +1 more source
Polynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction [PDF]
Motivated by applications to sensor networks, as well as to many other areas, this paper studies the construction of minimum-degree spanning trees. We consider the classical node-register state model, with a weakly fair scheduler, and we present a space ...
Blin, Lélia, Fraigniaud, Pierre
core
Scanning transmission electron microscopy imaging techniques are an essential tool to document dynamic developments, such as precipitation in aluminum alloys, during in situ heating experiments using transmission electron microscopy. However, in many cases, chemical information is required to interpret complex nanoscale processes.
Evelin Fisslthaler +4 more
wiley +1 more source
Non-Projective Dependency Parsing using Spanning Tree Algorithms
We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this representation, the parsing algorithm of Eisner (1996) is sufficient for searching over all projective trees in O(n3) time.
Ryan T. McDonald +3 more
semanticscholar +1 more source
Commercial light‐based 3D printers increasingly find use for industry‐scale production of microstructured tissue culture devices. How can commercial printer performance be assessed for a given application? This work introduces simplified quantitative metrics based on microstructural fidelity analysis, addressing key manufacturing challenges in scaling ...
Zoltán András Guller +4 more
wiley +1 more source

