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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
-
-
Vertex Shaders
In this chapter, we are going to access the Vertex Position node in the Vertex block of the master stack to change the position of the vertices of...
-
The Heterogeneous Rooted Tree Cover Problem
We consider the heterogeneous rooted tree cover (HRTC) problem. Concretely, given an undirected complete graph...
-
Stability, Vertex Stability, and Unfrozenness for Special Graph Classes
Frei et al. (J. Comput. Syst. Sci. 123 , 103–121,
2022 ) show that the stability, vertex stability, and unfrozenness problems with respect to certain...
-
The Complexity of Cluster Vertex Splitting and Company
Clustering a graph when the clusters can overlap can be seen from three different angles: We may look for cliques that cover the edges of the graph...
-
Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity
For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained...
-
Solving Vertex Cover in Polynomial Time on Hyperbolic Random Graphs
The computational complexity of the VertexCover problem has been studied extensively. Most notably, it is NP-complete to find an optimal solution and...
-
Vertex Cover at Distance on H-Free Graphs
The question of characterizing graphs H such that the Vertex Cover problem is solvable in polynomial time in the class of H-free graphs is...