Results 71 to 80 of about 17,195 (263)
A New and Fast Approximation Algorithm for Vertex Cover Using a Maximum Independent Set (VCUMI)
The importance of non-deterministic polynomial (NP) problems in real world scenarios has compelled researchers to consider simple ways of finding approximate solutions to these problems in polynomial time.
Imran Khan, Naveed Riaz
doaj
Chiral SURMOFs for Vibrational Circular Dichroism: Multiscale Modeling and Experimental Insights
The use of solid‐state vibrational circular dichroism (VCD) for MOFs is still somewhat unexplored, and in this work, it is shown that chiral surface‐anchored MOFs (SURMOFs) grown on CaF2 provide an excellent platform for VCD. Experimental results are validated through multiscale modeling, showing strong agreement across multiple spectroscopic ...
Ana C. Fingolo +9 more
wiley +1 more source
Fluoroalkyl‐functionalized tin–oxo nanoclusters (N‐TOC6) enable robust pattern formation through ligand crosslinking under EUV exposure without thermal processing. Sn–F coordination mitigates the Lewis acidity of Sn centers, suppressing reactions with airborne molecules and improving post‐exposure pattern stability.
Yejin Ku +18 more
wiley +1 more source
The standard graded property for vertex cover algebras of quasi-trees
In [5] the authors characterize the vertex cover algebras which are tandard graded. In this paper we give a simple combinatorial criterion for the standard graded property of vertex cover algebras in the case of quasi-trees.
Alexandru Costantinescu, Le Dinh Nam
doaj
Monitoring Layout and Optimisation Method Based on Minimum Weighted Vertices of Roads
By analyzing the coverage model of cameras, a surveillance camera network model based on road vertex coverage is proposed, and an optimized deployment method for cameras based on the Minimum Weighted Vertex Cover (MWVC) model is given.
Li Wang +3 more
doaj +1 more source
Graphoidal graphs and graphoidal digraphs: a generalization of line graphs
A graphoidal cover of a graph G is a collection ψ of paths (not necessarily open) in G such that each path in ψ has at least two vertices, every vertex of G is an internal vertex of at most one path in ψ, and every edge of G is in exactly one path in Let
S. Arumugam, Jay S. Bagga
doaj +1 more source
High Entropy Wide‐Bandgap Borates with Broadband Luminescence and Large Nonlinear Optical properties
High‐entropy rare‐earth borates exhibit excellent nonlinear optical and broadband luminescence properties arising from multi‐component doping, chemical disorder, increased configurational entropy, and increased lattice and electronic anharmonicity. This formulation enabled us to obtain a large, environmentally stable single crystal with 3X higher laser‐
Saugata Sarker +14 more
wiley +1 more source
Solving Vertex Cover Problem Using DNA Tile Assembly Model
DNA tile assembly models are a class of mathematically distributed and parallel biocomputing models in DNA tiles. In previous works, tile assembly models have been proved be Turing-universal; that is, the system can do what Turing machine can do. In this
Zhihua Chen +3 more
doaj +1 more source
Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among graphs on n ...
Matt Noble +3 more
doaj +1 more source
MAGTWIST: A compact magnetic rotary actuator, enabling smooth, stepless rotation, and on‐demand locking. Inspired by peristalsis, a soft polymer belt generates a traveling‐wave, enabling 270° rotation when heated. Cooling stiffens the belt, locking it in position and enabling it to withstand high loads.
Simon Frieler +3 more
wiley +1 more source

