Login / Signup
Graphs with equal eternal vertex cover and eternal domination numbers.
William Klostermeyer
Christina M. Mynhardt
Published in:
Discret. Math. (2011)
Keyphrases
</>
vertex cover
planar graphs
approximation algorithms
partial order
directed graph
graph theory
np hard
undirected graph
precedence constraints
lower bound
scheduling problem
polynomial time approximation