Results 281 to 290 of about 165,258 (315)
Some of the next articles are maybe not open access.
Refined memorization for vertex cover
Information Processing Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chandran, L., Grandoni, F.
openaire +3 more sources
A probabilistic algorithm for vertex cover
Theoretical Computer Science, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Berend, D., Mamana, S.
openaire +2 more sources
Vertex covers and connected vertex covers in 3-connected graphs
1991 IEEE International Symposium on Circuits and Systems (ISCAS), 1991Discusses 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
The Minimum Generalized Vertex Cover Problem
ACM Transactions on Algorithms, 2003Let G = ( V , E ) be an undirected graph, with three numbers d 0 ( e ) ≥ d 1 ( e ) ≥ d 2 ( e
Refael Hassin, Asaf Levin
openaire +1 more source
Improved approximation of maximum vertex cover
Operations Research Letters, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
GALLUCCIO A., NOBILI, Paolo
openaire +4 more sources
Vertex Weighted Complexities of Graph Coverings
Algebra Colloquium, 2011In this paper the vertex weighted complexity of a graph is considered. A generalization of Northshield's Theorem for the vertex weighted complexity of a graph is presented. Furthermore, an explicit formula for the vertex weighted complexity of a covering graph of G in terms of that of G is given.
Wu, Hongfeng, Feng, Rongquan, Sato, Iwao
openaire +2 more sources
Mortal and eternal vertex covers
2016Summary: A vertex cover of a graph \(G = (V, E)\) is a subset \(S\subseteq V\) such that every edge is incident with at least one vertex in 5, and \(\alpha(G)\) is the cardinality of a smallest vertex cover. For a given vertex cover 5, a defense by \(S\) to an attack on an edge \(e = {vw}\) where \(v\in S\), is a one-to-one function \(f: S\to V\), such
Anderson, Mark +4 more
openaire +1 more source
Fractional Vertex Cover Reliability of Graphs
Journal of Combinatorial Mathematics and Combinatorial ComputingLet G be a graph and let 0 ≤ p , q and p + q ≤ 1 . Suppose that each vertex of G gets a weight of 1 with probability p , 1 2 with probability q , and 0 with probability 1 − p − q , and vertex weight probabilities are independent. The \textit{fractional vertex cover reliability} of G , denoted by FRel ( G ; p , q ) , is the probability
Brown, David +6 more
openaire +1 more source
Cryo-EM structures of herpes simplex virus type 1 portal vertex and packaged genome
Nature, 2019Yun-Tao Liu, Jonathan Jih, Xinghong Dai
exaly