The Complexity of Temporal Vertex Cover in Small-Degree Graphs.

Thekla Hamm Nina Klobas George B. Mertzios Paul G. Spirakis

Published in: CoRR (2022)

Keyphrases

vertex cover
brute force search
planar graphs
approximation algorithms
worst case
np hard
spanning tree
precedence constraints
search algorithm
special case
directed graph
branch and bound algorithm
bipartite graph
polynomial time approximation