Results 71 to 80 of about 2,495,395 (314)
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
Bidimensionality and Geometric Graphs
, 2011 In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and subexponential time parameterized algorithms for problems on classes of graphs which are not minor closed, but instead exhibit a ...
Fomin, Fedor V. +2 more
core +2 more sources
Coresets Meet EDCS: Algorithms for Matching and Vertex Cover on Massive Graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2017 Randomized composable coresets were introduced recently as an effective technique for solving matching and vertex cover problems in various models of computation. In this technique, one partitions the edges of an input graph randomly into multiple pieces,
Sepehr Assadi +4 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
Efficient Processing of k-Hop Reachability Queries on Directed Graphs
Applied Sciences, 2023 Given a directed graph, a k-hop reachability query, u→?kv, is used to check for the existence of a directed path from u to v that has a length of at most k.
Xian Tang +4 more
doaj +1 more source
Towards optimal kernel for connected vertex cover in planar graphs [PDF]
, 2011 We study the parameterized complexity of the connected version of the vertex cover problem, where the solution set has to induce a connected subgraph. Although this problem does not admit a polynomial kernel for general graphs (unless NP is a subset of ...
Kowalik, Lukasz +2 more
core
Deterministically Maintaining a (2+ε)-Approximate Minimum Vertex Cover in O(1/ε2) Amortized Update Time [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2018 We consider the problem of maintaining an (approximately) minimum vertex cover in an n-node graph G = (V,E) that is getting updated dynamically via a sequence of edge insertions/deletions.
Sayan Bhattacharya, Janardhan Kulkarni
semanticscholar +1 more source
Machine Learning‐Enabled Polymer Discovery for Enhanced Pulmonary siRNA Delivery
Advanced Functional Materials, EarlyView.This study provides an efficient approach to train a machine learning model by merging heterogeneous literature data to predict suitable polymers for siRNA delivery. Without the need for extensive laboratory synthesis, the machine learning enabled a virtual screening and successfully predicted a polymer that is validated for effective gene silencing in
Felix Sieber‐Schäfer +10 more
wiley +1 more source
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
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