Results 221 to 230 of about 1,660,013 (253)
Some of the next articles are maybe not open access.

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

Vertex cover in conflict graphs

Theoretical Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongjing Miao   +3 more
openaire   +2 more sources

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   +3 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

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   +2 more
openaire   +2 more sources

Solving #SAT Using Vertex Covers

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

Extended formulations for vertex cover

Operations Research Letters, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Evolutionary algorithms for vertex cover

1998
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel encoding scheme for VC and related problems that treats each chromosome as a binary decision diagram.
openaire   +2 more sources

The Minimum Generalized Vertex Cover Problem

ACM Transactions on Algorithms, 2003
Let G = ( V , E ) be an undirected graph, with three numbers d 0 ( e ) ≥ d 1 ( e ) ≥ d 2 ( e
Refael Hassin, Asaf Levin
openaire   +2 more sources

On the vertex covering sets and vertex cover polynomials of square of paths

IOSR Journal of Mathematics, 2013
Let G be a graph of order n with no isolated vertex. Let (G,i) be the family of vertex covering sets in G with cardinality i and let c(G, i) = | |. The polynomial C(G, x) = c(G, i) is called the vertex cover polynomial of G. In this paper, we obtain some properties of the polynomial C( ) and its coefficients.
openaire   +1 more source

Home - About - Disclaimer - Privacy