Results 11 to 20 of about 1,660,013 (253)
Capacitated vertex covering [PDF]
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 +3 more sources
Parameterized Power Vertex Cover [PDF]
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.
Eric Angel +3 more
doaj +1 more source
Angle Covers: Algorithms and Complexity
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering- an angle- such that each edge ...
William Evans +3 more
doaj +1 more source
A Constructive Characterization of Vertex Cover Roman Trees
A Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for which f (v) = 2.
Martínez Abel Cabrera +2 more
doaj +1 more source
Improving Vertex Cover as a Graph Parameter [PDF]
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 +1 more source
Frugality Ratios and Improved Truthful Mechanisms for Vertex Cover [PDF]
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay as little as possible.
Elkind, Edith +2 more
core +2 more sources
On Cutwidth Parameterized by Vertex Cover [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marek Cygan +4 more
openaire +8 more sources
Stackelberg Vertex Cover on a Path
22 pages, 2 figures, 4 algorithms, extended abstract published at ...
Katharina Eickhoff +2 more
openaire +3 more sources
TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$
A k-path vertex cover (k-PVC) of a graph G is a vertex subset I such that each path on k vertices in G contains at least one member of I. Imagine that a token is placed on each vertex of a k-PVC.
Duc A. Hoang
doaj +1 more source
ALGORITMO DE COBERTURA DE VÉRTICES
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

