C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Exploring the gap between treedepth and vertex cover through vertex integrity.
Tatsuya Gima
Tesshu Hanaka
Masashi Kiyomi
Yasuaki Kobayashi
Yota Otachi
Published in:
Theor. Comput. Sci. (2022)
Keyphrases
</>
vertex cover
approximation algorithms
partial order
undirected graph
precedence constraints
planar graphs
optimality criterion
special case
search space
np hard
directed graph
polynomial time approximation
branch and bound algorithm