Results 61 to 70 of about 166,020 (278)
Advanced Functional Materials, EarlyView.Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco +8 more
wiley +1 more source
Message passing for vertex covers [PDF]
Physical Review E, 2006 Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze message passing techniques, namely warning and survey propagation, which serve as efficient heuristic algorithms for solving these computational hard problems. We show also, how
Martin Weigt, Haijun Zhou
openaire +3 more sources
Simultaneously dominating all spanning trees of a graph
Electronic Journal of Graph Theory and Applications, 2022 We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover.
Sebastian Johann +2 more
doaj +1 more source
Advanced Functional Materials, Volume 36, Issue 43, 29 May 2026.A previously unreported coordination motif stabilising single Fe atoms by indigo chelation and pyridyl coordination on Au(111) has been revealed. By using planar tritopic pyridyl linkers (TPyB), extended 2D porous networks of indigo3(TPyB)2Fe6 form. These networks can be crystalline or vitreous and offer an environment where individual coordination ...
Hongxiang Xu +9 more
wiley +1 more source
An Exact Algorithm for Minimum Vertex Cover Problem
Mathematics, 2019 In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang +3 more
doaj +1 more source
IEEE Access, 2022 The Minimum Weighted Connected Vertex Cover problem (MWCVC) is to find a subset $F\subset V(G)$ with minimum weight in a node-weighted graph $G$ , such that when removing the set $F$ , the inducing graph of remaining vertices holds no edges, and the ...
Qipeng Xie +4 more
doaj +1 more source
Parameterized Streaming Algorithms for Vertex Cover [PDF]
, 2014 As graphs continue to grow in size, we seek ways to effectively process such data at scale. The model of streaming graph processing, in which a compact summary is maintained as each edge insertion/deletion is observed, is an attractive one.
Chitnis, Rajesh +3 more
core
Predicting Atomic Charges in MOFs by Topological Charge Equilibration
Advanced Functional Materials, Volume 36, Issue 43, 29 May 2026.An atomic charge prediction method is presented that is able to accurately reproduce ab‐initio‐derived reference charges for a large number of metal–organic frameworks. Based on a topological charge equilibration scheme, static charges that fulfill overall neutrality are quickly generated.
Babak Farhadi Jahromi +2 more
wiley +1 more source
Properties of vertex cover obstructions
Discrete Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael J. Dinneen, Rongwei Lai
openaire +2 more sources
Dispensing Volumetric Additive Manufacturing
Advanced Functional Materials, Volume 36, Issue 44, 1 June 2026.Dispensing volumetric additive manufacturing (DVAM) prints 3D structures inside a photocurable resin droplet suspended from the tip of a glass pipette, enabling sequential printing without resin vats or manual part removal. Real‐time droplet profiling and ray‐tracing‐based correction compensate for optical distortion at the curved resin‐air interface ...
Hongryung Jeon +5 more
wiley +1 more source