Results 221 to 230 of about 17,195 (263)

Vertex Cover Meets Scheduling

Algorithmica, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Epstein, L., Levin, A., Woeginger, G.J.
openaire   +1 more source

A 5k-vertex kernel for 3-path vertex cover

Theoretical Computer Science, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyu Xiao, Shaowei Kou
openaire   +1 more source

Solving #SAT Using Vertex Covers

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

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

Refined memorization for vertex cover

Information Processing Letters, 2004
zbMATH 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, 2022
zbMATH 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), 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

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   +1 more source

Improved approximation of maximum vertex cover

Operations Research Letters, 2006
zbMATH 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, 2011
In 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