The complexity of dissociation set problems in graphs.

Yury L. Orlovich Alexandre Dolgui Gerd Finke Valery S. Gordon Frank Werner

Published in: Discret. Appl. Math. (2011)

Keyphrases

polynomial time complexity
decision problems
np complete
graph theory
graph matching
optimization problems
solving problems
graph theoretic
polynomial hierarchy