• Corpus ID: 245853697

Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs

  title={Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs},
  author={Neeldhara Misra and Saraswati Nanoti},
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 vertices of a graph. In every move, one player (the attacker) attacks an edge. In response to the attack, the second player (the defender) moves some of the guards along the edges of the graph in such a manner that at least one guard moves along the attacked edge. If such a movement is not possible, then the attacker wins. If the defender can defend the… 


Graphs with equal eternal vertex cover and eternal domination numbers
Parameterized algorithm for eternal vertex cover
Eternal Connected Vertex Cover Problem
A new variant of the classic problem of Vertex Cover (VC) is introduced, which asks the minimum number of guards to be placed on the vertices of a given G, that is sufficient to repel any sequence of edge attacks of an arbitrary length.
Edge protection in graphs
Upper and lower bounds on the minimum number of guards needed for this eternal vertex cover problem are proved and the graphs for which the upper bound is sharp are characterized.
A New Lower Bound for the Eternal Vertex Cover Number of Graphs
We obtain a new lower bound for the eternal vertex cover number of an arbitrary graph G, in terms of the cardinality of a vertex cover of minimum size in G containing all its cut vertices. The
Kernelization Lower Bounds Through Colors and IDs
Many of the results also rule out the existence of compression algorithms, a notion similar to kernelization defined by Harnik and Naor [2007], for the problems in question.
Parameterized Algorithms
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area, providing a toolbox of algorithmic techniques.
Parameterized Complexity Theory
  • J. Flum, Martin Grohe
  • Computer Science
    Texts in Theoretical Computer Science. An EATCS Series
  • 2006
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The