Results 61 to 70 of about 165,258 (315)
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 complexity of fair deletion problems
, 2017 Deletion problems are those where given a graph $G$ and a graph property $\pi$, the goal is to find a subset of edges such that after its removal the graph $G$ will satisfy the property $\pi$. Typically, we want to minimize the number of elements removed.
Masařík, Tomáš, Toufar, Tomáš
core +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
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Mathematics, 2022 Graphs serve as one of the main tools for the mathematical modeling of various human problems. Fuzzy graphs have the ability to solve uncertain and ambiguous problems.
Huiqin Jiang +4 more
doaj +1 more source
Adding Isolated Vertices Makes some Online Algorithms Optimal
, 2016 An unexpected difference between online and offline algorithms is observed. The natural greedy algorithms are shown to be worst case online optimal for Online Independent Set and Online Vertex Cover on graphs with 'enough' isolated vertices, Freckle ...
A Gyárfás +9 more
core +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
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
Cover pebbling numbers and bounds for certain families of graphs [PDF]
, 2004 Given a configuration of pebbles on the vertices of a graph, a pebbling move is defined by removing two pebbles from some vertex and placing one pebble on an adjacent vertex.
Watson, Nathaniel G., Yerger, Carl R.
core +1 more source
Minimum Vertex Cover in Rectangle Graphs [PDF]
Computational Geometry, 2010 We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$ is connected for every pair of rectangles $R_1,R_2 \in \calR$.
Bar-Yehuda, R., Hermelin, D., Rawitz, D.
openaire +5 more sources
Entangled Multistable Origami with Reprogrammable Stiffness Amplification and Damping
Advanced Functional Materials, EarlyView.This study introduces a class of origami‐inspired metamaterials that overcome the limitations of existing multistable metamaterials by eliminating the need for rigid lateral confinements. Panel entanglement, snap‐through interactions, and instabilities synergy enable them to achieve extensive shape‐shifting, enhanced stiffness, and remarkable energy ...
Amin Jamalimehr +2 more
wiley +1 more source