Results 241 to 250 of about 166,020 (278)

Vertex Cover Meets Scheduling

Algorithmica, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein, Asaf Levin, Gerhard J. Woeginger   +2 more
openaire   +1 more source

Maximum Minimal Vertex Cover Parameterized by Vertex Cover

SIAM Journal on Discrete Mathematics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On approximation of max-vertex-cover

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qiaoming Han, Yinyu Ye 0001, Hantao Zhang 0001, Jiawei Zhang 0006   +3 more
openaire   +1 more source

Secure vertex cover of a graph

Discrete Mathematics, Algorithms and Applications, 2017
We study the problem of using mobile guards to defend the vertices of a graph [Formula: see text] against a single attack on its vertices. A vertex cover of a graph [Formula: see text] is a set [Formula: see text] such that for each edge [Formula: see text], at least one of [Formula: see text] or [Formula: see text] is in [Formula: see text].
P. Roushini Leely Pushpam, Chitra Suseendran   +1 more
openaire   +2 more sources

Vertex cover in conflict graphs

Theoretical Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongjing Miao, Xianmin Liu, Yingshu Li 0001, Jianzhong Li 0001   +3 more
openaire   +1 more source

Vertex covers and connected vertex covers in 3-connected graphs

1991 IEEE International Symposium on Circuits and Systems (ISCAS), 1991
Discusses time complexity analysis of the minimum vertex cover and minimum connected vertex cover problems for 3-connected graphs. A vertex cover of a graph G=(V, E) is a subset N of V such that each element of E is incident upon some element of N, where V and E are the sets of vertices and of edges of G, respectively.
T. Watanabe, S. Kajita, K. Onaga
openaire   +1 more source

A list heuristic for vertex cover

Operations Research Letters, 2007
A class of approximation algorithms for the minimum vertex cover problem for graphs is studied. These algorithms, called list heuristics, handle the vertices in a given static order based on the degree sequence. The authors prove an approximation ratio of at most \(\sqrt{\Delta}/2+\frac{3}{2}\) for a nonincreasing degree sequence, and show that no ...
David Avis, Tomokazu Imamura
openaire   +2 more sources

Multiple vertex coverings by cliques

Journal of Graph Theory, 2004
For positive integers \(m_1,\dots,m_k\), let \(f(m_1,\dots,m_k)\) be the minimum order of a graph whose edges can be colored with \(k\) colors such that every vertex is in a clique of cardinality \(m_i\), all of whose edges have the \(i\)th color for all \(i=1,2,\dots,k\). The value for \(k=2\) was determined by \textit{R. C. Entringer} et al. [J Graph
Wayne Goddard, Michael A. Henning
openaire   +2 more sources

Solving #SAT Using Vertex Covers

Acta Informatica, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider   +2 more
openaire   +2 more sources

Paths, Flowers and Vertex Cover

2011
It is well known that in a bipartite (and more generally in a Konig) graph, the size of the minimum vertex cover is equal to the size of the maximum matching. We first address the question whether (and if not when) this property still holds in a Konig graph if we insist on forcing one of the two vertices of some of the matching edges in the vertex ...
Venkatesh Raman 0001, M. S. Ramanujan 0001, Saket Saurabh 0001   +2 more
openaire   +1 more source