Results 251 to 260 of about 166,020 (278)
Some of the next articles are maybe not open access.
The Minimum Generalized Vertex Cover Problem
ACM Transactions on Algorithms, 2003Let G = ( V , E ) be an undirected graph, with three numbers d 0 ( e ) ≥ d 1 ( e ) ≥ d 2 ( e
Refael Hassin, Asaf Levin
openaire +1 more source
Extended formulations for vertex cover
Operations Research Letters, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Evolutionary algorithms for vertex cover
1998This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel encoding scheme for VC and related problems that treats each chromosome as a binary decision diagram.
openaire +1 more source
On the vertex covering sets and vertex cover polynomials of square of paths
IOSR Journal of Mathematics, 2013Let G be a graph of order n with no isolated vertex. Let (G,i) be the family of vertex covering sets in G with cardinality i and let c(G, i) = | |. The polynomial C(G, x) = c(G, i) is called the vertex cover polynomial of G. In this paper, we obtain some properties of the polynomial C( ) and its coefficients.
openaire +1 more source
Mortal and eternal vertex covers
2016Summary: A vertex cover of a graph \(G = (V, E)\) is a subset \(S\subseteq V\) such that every edge is incident with at least one vertex in 5, and \(\alpha(G)\) is the cardinality of a smallest vertex cover. For a given vertex cover 5, a defense by \(S\) to an attack on an edge \(e = {vw}\) where \(v\in S\), is a one-to-one function \(f: S\to V\), such
Anderson, Mark +4 more
openaire +1 more source
A theorem on the approximation of set cover and vertex cover
1991An approximation result is given, connecting two well known combinatorial problems, the Set Cover and the Vertex Cover. This result constitutes an improvement of the existing ratio for the latter, on a large and intuitive class of graphs, provided that an approximation algorithm exists for the former.
openaire +1 more source
Exploring the gap between treedepth and vertex cover through vertex integrity
Theoretical Computer Science, 2022Tatsuya Gima +2 more
exaly
Parameterized Complexity of Vertex Cover Variants
Theory of Computing Systems, 2007Jiong Guo +2 more
exaly