Results 221 to 230 of about 17,985 (261)
Some of the next articles are maybe not open access.
A probabilistic algorithm for vertex cover
Theoretical Computer Science, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Berend, S. Mamana
openaire +2 more sources
A 5k-vertex kernel for 3-path vertex cover
Theoretical Computer Science, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyu Xiao
exaly +2 more sources
Refined memorization for vertex cover
Information Processing Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Sunil Chandran +1 more
openaire +3 more sources
Algorithmica, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leah Epstein +2 more
openaire +1 more source
Maximum Minimal Vertex Cover Parameterized by Vertex Cover
SIAM Journal on Discrete Mathematics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On approximation of max-vertex-cover
European Journal of Operational Research, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qiaoming Han +3 more
openaire +1 more source
Secure vertex cover of a graph
Discrete Mathematics, Algorithms and Applications, 2017We 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 +1 more
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
Vertex cover in conflict graphs
Theoretical Computer Science, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dongjing Miao +3 more
openaire +1 more source