The Complexity of Some Problems on Maximal Independent Sets in Graphs.

Igor E. Zverovich Yury L. Orlovich

Published in: OR (2002)

Keyphrases

decision problems
benchmark problems
problems involving
computational complexity
np hard
worst case
np complete
computational issues
polynomial hierarchy
association rules
optimization problems
directed graph
graph matching
graph structure
np hardness