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:
CoRR (2021)
Keyphrases
</>
vertex cover
approximation algorithms
planar graphs
partial order
precedence constraints
optimality criterion
undirected graph
scheduling problem
polynomial time approximation
special case
np hard
log likelihood
probabilistic model
directed graph