Complexity of modification problems for best match graphs.

David Schaller Peter F. Stadler Marc Hellmuth

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

Keyphrases

decision problems
problems involving
data mining
information systems
optimization problems
np complete
computer vision
computational complexity
application domains
directed graph
graph partitioning
polynomial time complexity