The complexity of multicut and mixed multicut problems in (di)graphs.

Jørgen Bang-Jensen Anders Yeo

Published in: Theor. Comput. Sci. (2014)

Keyphrases

decision problems
worst case
graph matching
benchmark problems
problems involving
pattern recognition
computational complexity
np complete
computational biology
solving problems
np hardness
polynomial hierarchy
polynomial time complexity