Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms.

Kaustav Paul Arti Pandey

Published in: CALDAM (2024)

Keyphrases

vertex cover
computational complexity
graph theory
space complexity
learning algorithm
approximation algorithms
worst case
optimization problems
planar graphs
scheduling problem
theoretical analysis
error bounds
optimality criterion