Login / Signup
Extension of Vertex Cover and Independent Set in Some Classes of Graphs.
Katrin Casel
Henning Fernau
Mehdi Khosravian Ghadikolaei
Jérôme Monnot
Florian Sikora
Published in:
CIAC (2019)
Keyphrases
</>
independent set
vertex cover
approximation algorithms
maximum independent set
planar graphs
partial order
maximum weight
precedence constraints
polynomial time approximation
objective function
search algorithm
computational complexity
np hard
graph theoretic
log likelihood