Results 51 to 60 of about 145,499 (286)
Distributed Dominating Set Approximations beyond Planar Graphs
, 2019 The Minimum Dominating Set (MDS) problem is one of the most fundamental and challenging problems in distributed computing. While it is well-known that minimum dominating sets cannot be approximated locally on general graphs, over the last years, there ...
Amiri, Saeed Akhoondian +2 more
core +1 more source
Harnessing Fungal Biowelding for Constructing Mycelium‐Engineered Materials
Advanced Engineering Materials, EarlyView.Mycelium‐bound composites (MBCs) offer low‐carbon alternatives for construction, yet interfacial bonding remains a critical challenge. This review examines fungal biowelding as a biocompatible adhesive, elucidating mycelium‐mediated interfacial mechanisms and their role in material assembly. Strategies to optimize biowelding are discussed, highlighting
Xue Brenda Bai +2 more
wiley +1 more source
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
Advanced Engineering Materials, EarlyView.This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice +2 more
wiley +1 more source
Light Graphs In Planar Graphs Of Large Girth
Discussiones Mathematicae Graph Theory, 2016 A graph H is defined to be light in a graph family 𝒢 if there exist finite numbers φ(H, 𝒢) and w(H, 𝒢) such that each G ∈ 𝒢 which contains H as a subgraph, also contains its isomorphic copy K with ΔG(K) ≤ φ(H, 𝒢) and ∑x∈V(K) degG(x) ≤ w(H, 𝒢).
Hudák Peter +3 more
doaj +1 more source
About Structure of Graph Obstructions for Klein Surface with 9 Vertices
Кібернетика та комп'ютерні технології, 2020 The structure of the 9 vertex obstructive graphs for the nonorientable surface of the genus 2 is established by the method of (-transformations of the graphs.
V.I. Petrenjuk, D.A. Petrenjuk
doaj +1 more source
Statistics of Feynman amplitudes in ϕ 4-theory
Journal of High Energy Physics, 2023 The amplitude of subdivergence-free logarithmically divergent Feynman graphs in ϕ 4-theory in 4 spacetime dimensions is given by a single number, the Feynman period. We numerically compute the periods of 1.3 million completed graphs, this represents more
Paul-Hermann Balduf
doaj +1 more source
Cuts in matchings of 3-connected cubic graphs [PDF]
, 2018 We discuss conjectures on Hamiltonicity in cubic graphs (Tait, Barnette, Tutte), on the dichromatic number of planar oriented graphs (Neumann-Lara), and on even graphs in digraphs whose contraction is strongly connected (Hochst\"attler). We show that all
Knauer, Kolja, Valicov, Petru
core +2 more sources
Journal of Combinatorial Theory, Series B, 1973 AbstractAn F-planar graph, where F is an ordered field, is a graph that can be represented in the plane F × F, with non-crossing line segments as edges. It is shown that the graph G is F-planar for some F if and only if every finite subgraph of G is planar.
openaire +2 more sources
Packaging of Macroscopic Material Payloads: Needs, Challenges, Concepts, and Future Directions
Advanced Engineering Materials, EarlyView.This review introduces a unified framework that decomposes any macroscopic packaging system into the payload, packaging material, and packaging strategy and combines them into a conceptual packaging equation: packaging strategy = payload + packaging material.
Venkata S. R. Jampani, Manos Anyfantakis
wiley +1 more source
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [PDF]
, 2008 We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolation lemma as described in (Mulmuley et al.
Datta, Samir +2 more
core +7 more sources