Results 11 to 20 of about 142,209 (249)
Improving Vertex Cover as a Graph Parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
doaj +6 more sources
Message passing for vertex covers [PDF]
Physical Review E, 2006 Constructing a minimal vertex cover of a graph can be seen as a prototype for a combinatorial optimization problem under hard constraints. In this paper, we develop and analyze message passing techniques, namely warning and survey propagation, which serve as efficient heuristic algorithms for solving these computational hard problems. We show also, how
Martin Weigt, Haijun Zhou
openalex +5 more sources
The vertex-cover polynomial of a graph [PDF]
Discrete Mathematics, 2002 Let \(G\) be an undirected graph without multiple edges but possibly with loops. By an \(r\)-vertex cover in \(G\) we mean an \(r\)-element subset of the vertex set which has a common vertex with every edge in \(G\). Let \(\text{ cv}(G,r)\) be the number of \(r\)-vertex covers in \(G\).
Fengming Dong +3 more
openalex +4 more sources
Theory of Computing Systems, 2019 Covering all edges of a graph by a small number of vertices, this is the NP-hard Vertex Cover problem, is among the most fundamental algorithmic tasks. Following a recent trend in studying dynamic and temporal graphs, we initiate the study of Multistage ...
Fluschnik, Till +3 more
core +7 more sources
Vertex Cover Reconfiguration and Beyond [PDF]
Algorithms, 2018 In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and ℓ and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most ℓ vertex additions or removals ...
Amer E. Mouawad +3 more
doaj +3 more sources
The Price of Connectivity for Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Graph ...
Eglantine Camby +3 more
doaj +5 more sources
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover [PDF]
, 2002 Given a $k$-uniform hyper-graph, the E$k$-Vertex-Cover problem is to find the smallest subset of vertices that intersects every hyper-edge. We present a new multilayered PCP construction that extends the Raz verifier.
Dinur, Irit +3 more
core +6 more sources
Dominating Vertex Covers: The Vertex-Edge Domination Problem [PDF]
Discussiones Mathematicae Graph Theory, 2021 The vertex-edge domination number of a graph, γve(G), is defined to be the cardinality of a smallest set D such that there exists a vertex cover C of G such that each vertex in C is dominated by a vertex in D.
Klostermeyer William F. +2 more
doaj +3 more sources
Squarefree vertex cover algebras [PDF]
Communications in Algebra, 2011 In this paper we introduce squarefree vertex cover algebras. We study the question when these algebras coincide with the ordinary vertex cover algebras and when these algebras are standard graded. In this context we exhibit a duality theorem for squarefree vertex cover algebras.
Shamila Bayati, Farhad Rahmati
openalex +5 more sources
Parameterized Power Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). In this problem, each edge of the input graph is supplied with a positive integer demand. A solution is an assignment of (power) values to the vertices, so that for each edge one of its endpoints has value as high as the demand, and the ...
Éric Angel +3 more
openalex +8 more sources