Search
Search Results
-
Parameterized Algorithms for Minimum Sum Vertex Cover
Minimum sum vertex cover of an n-vertex graph G is a bijection $$\phi : V(G)...
-
Multistage Vertex Cover
The NP-complete Vertex Cover problem asks to cover all edges of a graph by a small (given) number of vertices. It is among the most prominent...
-
Exact Approaches for the Connected Vertex Cover Problem
Given a graph G, the Connected Vertex Cover problem (CVC) asks to find a minimum cardinality vertex cover of G that induces a connected subgraph....
-
Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms
A variation of the vertex cover problem is the eternal vertex cover problem. This is a two-player (attacker and defender) game, where the defender...
-
Quantum speedup for solving the minimum vertex cover problem based on Grover search algorithm
The electronic computer possesses powerful computing capabilities, but it is still limited by Moore’s law. Quantum computers are thus found capable...
-
Correction to: Powers of the vertex cover ideals (Collect. Math. 65 (2014) 169–181)
We describe a combinatorial condition on a graphwhich guarantees that all powers of its vertex cover ideal are componentwise linear. Then motivated...
-
Small Vertex Cover Helps in Fixed-Parameter Tractability of Graph Deletion Problems over Data Streams
In the study of parameterized streaming complexity on graph problems, the main goal is to design streaming algorithms for parameterized problems such...
-
Above guarantee parameterization for vertex cover on graphs with maximum degree 4
In the vertex cover problem the input is a graph G and an integer k , and the goal is to decide whether there is a set of vertices S of size at most k ...
-
Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs
Eternal vertex cover problem is a variant of the vertex cover problem. It is a two player (attacker and defender) game in which given a graph...
-
A Parameterized Approximation Scheme for Generalized Partial Vertex Cover
Partial Vertex Cover is a well-studied generalization of the classic Vertex Cover problem, where we are given a graph...
-
Representation of the Eternal Vertex Cover Problem as a Dynamic Stackelberg Game
Eternal vertex cover problem is a variant of the graph vertex cover problem that can be considered as a dynamic game between two players (Attacker...
-
Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond
A dominating set S of graph G is called an r-grouped dominating set if S can be partitioned into...
-
Near-Bipartiteness, Connected Near-Bipartiteness, Independent Feedback Vertex Set and Acyclic Vertex Cover on Graphs Having Small Dominating Sets
In the Near-Bipartiteness problem, we are given a simple graph \(G=(V, E)\)...
-
Eternal Vertex Cover on Bipartite Graphs
The Eternal Vertex Cover problem is a dynamic variant of the vertex cover problem. We have a two player game in which guards are placed on some...
-
Generating Faster Algorithms for d-Path Vertex Cover
Many algorithms which exactly solve hard problems require branching on more or less complex structures in order to do their job. Those who design...
-
Target Set Selection Parameterized by Vertex Cover and More
Diffusion is a natural phenomenon in many real-world networks. Spreading of ideas, rumors in an online social network; propagation of virus, malware...
-
-
-
The Vertex Cover Game
The paper describes the vertex cover game (Gusev, Omega 97:102102, 2020) and shows its properties. The peculiarity of such a game is that it takes...