Results 11 to 20 of about 165,258 (315)

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., Messinger Margaret-Ellen, Yeo Anders   +2 more
doaj   +3 more sources

Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter [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
A. Schrijver, A. Soleimanfallah, B. Chor, B.M.P. Jansen, B.M.P. Jansen, C.K. Yap, F.N. Abu-Khzam, F.N. Abu-Khzam, G. Gutin, G. Nemhauser, H. Dell, H.L. Bodlaender, H.L. Bodlaender, H.L. Bodlaender, I. Razgon, J. Chen, J. Chen, J. Díaz, J. Guo, J. Uhlmann, J. Zito, J.F. Buss, J.R. Griggs, L. Cai, L. Fortnow, M. Chlebík, M. Cygan, M. Cygan, M. Dom, M.R. Fellows, M.R. Fellows, M.R. Fellows, M.R. Garey, R. Downey, R. Niedermeier, R. Niedermeier, R. Niedermeier, R.G. Downey, S. Khot, S. Kratsch, S. Mishra, V. Bafna, V. Estivill-Castro, V. Raman   +43 more
core   +3 more sources

Edge Dominating Sets and Vertex Covers

Discussiones Mathematicae Graph Theory, 2013
Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering ...
Dutton Ronald, Klostermeyer William F.
doaj   +3 more sources

On Graphs whose Eternal Vertex Cover Number and Vertex Cover Number\n Coincide [PDF]

Discrete Applied Mathematics, 2018
Preliminary version appeared in CALDAM ...
Jasine Babu, L. Sunil Chandran, Mathew C. Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier   +5 more
openalex   +4 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

Smaller parameters for vertex cover kernelization [PDF]

, 2017
We revisit the topic of polynomial kernels for Vertex Cover relative to structural parameters. Our starting point is a recent paper due to Fomin and Str mme [WG 2016] who gave a kernel with $\mathcal{O}(|X|^{12})$ vertices when $X$ is a vertex set such that each connected component of $G-X$ contains at most one cycle, i.e., $X$ is a modulator to a ...
Eva-Maria C. Hols, Stefan Kratsch
openalex   +5 more sources

Multistage Vertex Cover

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, Rolf Niedermeier, Valentin Rohm, Philipp Zschoche   +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, François Sellier
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
Guha, Sudipto, Hassin, Refael, Khuller, Samir, Or, Einat   +3 more
openaire   +2 more sources

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