Results 111 to 120 of about 1,660,013 (253)

An Improved Approximation Algorithm For Vertex Cover with Hard Capacities

open access: yes, 2003
In this paper we study the capacitated vertex cover problem, a generalization of the well-known vertex cover problem. Given a graph $G=(V,E)$, the goal is to cover all the edges by picking a minimum cover using the vertices.
Gandhi, Rajiv   +4 more
core   +2 more sources

Toward Perception‐Native Electronic Skin: Bio‐Inspired In‐/Near‐Sensor and Neuromorphic Computing for Humanoid Robots

open access: yesAdvanced Materials Technologies, EarlyView.
Dense tactile streams from across the humanoid body converge on collide in a central wiring and data bottleneck. By relocating computation closer to and then into the skin itself, near‐ and in‐sensor architectures, together with neuromorphic computing, chart a path toward perception‐native electronic skin, in which the conversion of stimulus into ...
Mijin Kim   +6 more
wiley   +1 more source

Treewidth and Pathwidth Parameterized by the Vertex Cover Number

open access: yes, 2013
International audienceAfter the number of vertices, Vertex Cover Number is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not ...
Yngve Villanger   +7 more
core   +1 more source

Bounds on the Clique and the Independence Number for Certain Classes of Graphs

open access: yesMathematics
In this paper, we study the class of graphs Gm,n that have the same degree sequence as two disjoint cliques Km and Kn, as well as the class G¯m,n of the complements of such graphs.
Valentin E. Brimkov, Reneta P. Barneva
doaj   +1 more source

Solving Vertex Cover Problem Using DNA Tile Assembly Model

open access: yesJournal of Applied Mathematics, 2013
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

Liquid Metal Resistive Sensing Architectures for Measuring Diaphragm Strain Responses on Obstructed Surfaces

open access: yesAdvanced Materials Technologies, EarlyView.
A liquid metal‐based strain‐sensing architecture to measure the deformation of a circular diaphragm against obstructed surfaces is formulated using finite element modeling and confocal imaging to establish the mechanical framework and is utilized to control diaphragm‐induced confinement on a bead array, as validated by biomolecular loading level ...
Abdullah‐Bin Siddique   +4 more
wiley   +1 more source

An efficient exact algorithm for Constraint Bipartite Vertex Cover

open access: yes, 1999
The "Constraint Bipartite Vertex Cover " problem (CBVC for short) is: given a bipartite graph G with n vertices and two positive integers k1; k2, is there a vertex cover taking at most k1 vertices from one and at most k2 vertices from ...
Henning Fernau, Rolf Niedermeier
core   +1 more source

Chitin‐Chitosan Cryogels for the Reversible Sequestration and Recovery of Heavy Metals From Wastewater

open access: yesAdvanced Materials Technologies, EarlyView.
Chitin‐chitosan cryogels with degrees of N‐acetylation from 12.2% to 71.4% are fabricated by dissolution, coagulation and lyophilization for the sequestration of heavy metals from water. Colorimetry and differential pulse voltammetry showed controlled adsorption and desorption capacities for As5+, Co2+ and Cu2+, making this material attractive for ...
Marta García‐Castrillo   +4 more
wiley   +1 more source

Monitoring Layout and Optimisation Method Based on Minimum Weighted Vertices of Roads

open access: yesApplied Sciences
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

Minimum Sum Vertex Cover via Minimum Vertex Cover

open access: yes
The Minimum Sum Vertex Cover (MSVC) problem asks for an ordering of the vertices of a graph that minimizes the sum, over all edges, of the time at which each edge is first covered. We study the problem through the structure of vertex covers and obtain new approximation and exact algorithms, together with conditional lower bounds. For graphs of maximum
Biniaz, Ahmad   +4 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy