Results 231 to 240 of about 1,660,013 (253)
Some of the next articles are maybe not open access.
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 +2 more sources
Parameterized Complexity of Vertex Cover Variants
Theory of Computing Systems, 2007Rolf Niedermeier +2 more
exaly
An Improved Fixed-Parameter Algorithm for Vertex Cover
Information Processing Letters, 1998Venkatesh Raman, Michael Fellows
exaly
A Rough Set Method for the Minimum Vertex Cover Problem of Graphs
Applied Soft Computing Journal, 2016Jinjin Li, Jinkun Chen
exaly
A Better Approximation Ratio for the Vertex Cover Problem
ACM Transactions on Algorithms, 2009George Karakostas
exaly
A Fixed-Parameter Algorithm for the Vertex Cover P3 Problem
Information Processing Letters, 2015Jianhua Tu
exaly
A Population-Based Iterated Greedy Algorithm for the Minimum Weight Vertex Cover Problem
Applied Soft Computing Journal, 2012Christian Blum, Salim Bouamama
exaly
A Faster FPT Algorithm for 3-Path Vertex Cover
Information Processing Letters, 2016Jan Katrenic
exaly

