-
1
-
2
Parameterized Power Vertex Cover
Published 2018-10-01“…We study a recently introduced generalization of the Vertex Cover (VC) problem, called Power Vertex Cover (PVC). …”
Get full text
Article -
3
-
4
-
5
On The Study of Edge Monophonic Vertex Covering Number
Published 2022-12-01Subjects: Get full text
Article -
6
-
7
An Exact Algorithm for Minimum Vertex Cover Problem
Published 2019-07-01Subjects: “…vertex cover…”
Get full text
Article -
8
Dynamic Approximate Vertex Cover and Maximum Matching
Published 2012“…We consider the problem of maintaining a large matching or a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. …”
Get full text
Get full text
Article -
9
Dominating Vertex Covers: The Vertex-Edge Domination Problem
Published 2021-02-01Subjects: Get full text
Article -
10
A Constructive Characterization of Vertex Cover Roman Trees
Published 2021-02-01Subjects: Get full text
Article -
11
An Improved Memetic Algorithm for the Partial Vertex Cover Problem
Published 2019-01-01Subjects: Get full text
Article -
12
Competitive algorithms for online matching and vertex cover problems
Published 2014Get full text
Thesis -
13
Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts
Published 2017-12-01Subjects: Get full text
Article -
14
Bounds for graph energy in terms of vertex covering and clique numbers
Published 2019-10-01Subjects: “…graph energy, vertex covering number, clique number, maximum degree…”
Get full text
Article -
15
New Concepts of Vertex Covering in Cubic Graphs with Its Applications
Published 2022-01-01Subjects: Get full text
Article -
16
The standard graded property for vertex cover algebras of quasi-trees
Published 2008-11-01Subjects: “…Vertex cover Algebra…”
Get full text
Article -
17
Maintaining a large matching and a small vertex cover
Published 2012“…We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge insertion. …”
Get full text
Get full text
Article -
18
Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
Published 2015“…In this paper, we consider the minimum unweighted Vertex Cover problem with Hard Capacity constraints (VCHC) on multigraphs and hypergraphs. …”
Get full text
Get full text
Get full text
Article -
19
An Attention-Based Method for the Minimum Vertex Cover Problem on Complex Networks
Published 2024-02-01Subjects: Get full text
Article -
20
On the dimension of the minimal vertex cover semigroup ring of an unmixed bipartite graph
Published 2008-11-01Subjects: Get full text
Article