Results 51 to 60 of about 2,372,931 (298)
Local Search with Efficient Automatic Configuration for Minimum Vertex Cover
International Joint Conference on Artificial Intelligence, 2019 Minimum vertex cover (MinVC) is a prominent NP-hard problem in artificial intelligence, with considerable importance in applications. Local search solvers define the state of the art in solving MinVC.
Chuan Luo +5 more
semanticscholar +1 more source
Advanced Functional Materials, EarlyView.The separation of Helium gas from natural gas is challenging but highly important. MIL‐116(Ga), a “non‐porous” metal–organic framework is used as a molecular sieve to separate He from CH4. Druse‐like MIL‐116(Ga) particles are integrated into polysulfone mixed matrix membranes.
Ayisha Komal +10 more
wiley +1 more source
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, EarlyView.Intelligent radiative cooling devices, adaptable to various weather conditions, have the potential for year‐round energy savings. This study introduces a sustainable dual‐mode film made from polycaprolactone nanofibers and upcycled chip bags for effective thermal management.
Qimeng Song +4 more
wiley +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
Temporal Vertex Cover with a Sliding Time Window [PDF]
International Colloquium on Automata, Languages and Programming, 2018 Modern, inherently dynamic systems are usually characterized by a network structure, i.e. an underlying graph topology, which is subject to discrete changes over time.
Eleni C. Akrida +3 more
semanticscholar +1 more source
Advanced Functional Materials, EarlyView.HKUST‐1/TiO2 composite materials show a very high photocatalytic hydrogen evolution rate which increases as a function of the irradiation time until reaching a plateau and even surpasses the performance of the 1%Pt/TiO2 material after three photocatalytic cycles.
Alisha Khan +9 more
wiley +1 more source
Exact Crossing Number Parameterized by Vertex Cover [PDF]
International Symposium Graph Drawing and Network Visualization, 2019 We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when parameterized by the vertex cover size. This is a notable advance since we
Petr Hliněný, Abhisekh Sankaran
semanticscholar +1 more source
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
A STEGENOGRAPHY IN 3D MESH BY REARRANGING THE ORDER OF VERTEX PRESENTATION
Tạp chí Khoa học Đại học Đà Lạt, 2013 This paper proposes a method of data hiding approach on 3D mesh objects in the representation domain by rearranging the order of the vertices based on a secret key string (a list vertex that was previously traversed as highly secret).
Thái Duy Quý
doaj +1 more source