Results 11 to 20 of about 164,586 (274)
The standard graded property for vertex cover algebras of quasi-trees [PDF]
Le Matematiche, 2008 In [5] the authors characterize the vertex cover algebras which are tandard graded. In this paper we give a simple combinatorial criterion for the standard graded property of vertex cover algebras in the case of quasi-trees.
Alexandru Costantinescu, Le Dinh Nam
doaj +5 more sources
Parameterized Power Vertex Cover [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 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
A Constructive Characterization of Vertex Cover Roman Trees
Discussiones Mathematicae Graph Theory, 2021 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
Squarefree Vertex Cover Algebras [PDF]
Communications in Algebra, 2013 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.
Bayati, Shamila, Rahmati, Farhad
openaire +2 more sources
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 +1 more source
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
Vertex Cover Kernelization Revisited [PDF]
Theory of Computing Systems, 2012 An important result in the study of polynomial-time preprocessing shows that there is an algorithm which given an instance (G,k) of Vertex Cover outputs an equivalent instance (G',k') in polynomial time with the guarantee that G' has at most 2k' vertices
Jansen, Bart M. P., Bodlaender, Hans L.
openaire +4 more sources
p-Edge/vertex-connected vertex cover: Parameterized and approximation algorithms
Journal of Computer and System Sciences, 2023 We introduce and study two natural generalizations of the Connected VertexCover (VC) problem: the $p$-Edge-Connected and $p$-Vertex-Connected VC problem (where $p \geq 2$ is a fixed integer). Like Connected VC, both new VC problems are FPT, but do not admit a polynomial kernel unless $NP \subseteq coNP/poly$, which is highly unlikely.
Carl Einarson +4 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
TS-Reconfiguration of $k$-Path Vertex Covers in Caterpillars for $k \geq 4$
Theory and Applications of Graphs, 2023 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