Results 11 to 20 of about 166,020 (278)
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 +5 more sources
Dominating Vertex Covers: The Vertex-Edge Domination Problem
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
Theory of Computing Systems, 2022 AbstractThe NP-complete Vertex Cover problem asks to cover all edges of a graph by a small (given) number of vertices. It is among the most prominent graph-algorithmic problems. Following a recent trend in studying temporal graphs (a sequence of graphs, so-called layers, over the same vertex set but, over time, changing edge sets), we initiate the ...
Till Fluschnik +3 more
openaire +6 more sources
Matroid-constrained vertex cover
Theoretical Computer Science, 2023 In this paper, we introduce the problem of Matroid-Constrained Vertex Cover: given a graph with weights on the edges and a matroid imposed on the vertices, our problem is to choose a subset of vertices that is independent in the matroid, with the objective of maximizing the total weight of covered edges.
Chien-Chung Huang 0001 +1 more
openaire +3 more sources
Capacitated vertex covering [PDF]
Journal of Algorithms, 2003 Summary: 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)\) with weights on the vertices, the goal is to cover all the edges by picking a cover of minimum weight from the vertices. When we pick a copy of a vertex, we pay the weight of the vertex and cover up to
Sudipto Guha +3 more
openaire +2 more sources
On graphs whose eternal vertex cover number and vertex cover number coincide [PDF]
Discrete Applied Mathematics, 2022 Preliminary version appeared in CALDAM ...
Jasine Babu +5 more
openaire +2 more sources
Vertex cover and Edge vertex domination in trees
Proyecciones (Antofagasta), 2021 Let G = (V,E) be a simple graph. An edge e ∈ E(G) edge-vertex dominates a vertex v ∈ V (G) if e is incident with v or e is incident with a vertex adjacent to v. A subset D ⊆ E(G) is an edge-vertex dominating set of a graph G if every vertex of G is edge-vertex dominated by an edge of D.
Senthilkumar, B. +2 more
openaire +2 more sources
On Cutwidth Parameterized by Vertex Cover [PDF]
Algorithmica, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Cygan +4 more
openaire +6 more sources
Stackelberg Vertex Cover on a Path
, 2023 22 pages, 2 figures, 4 algorithms, extended abstract published at ...
Katharina Eickhoff +2 more
openaire +2 more sources
ALGORITMO DE COBERTURA DE VÉRTICES
Revista Ingeniería, Matemáticas y Ciencias de la Información, 2023 Problem to solve P=NP, using the coverage problem of a graph that is NP and convert it to P. In the mathematicaldiscipline of graph theory, a vertex cover, simply a graph cover, is a set of vertices such that each edge of the graph isincident to at least
Javier López Wong
doaj +1 more source