Maximum cut on interval graphs of interval count two is NP-complete.

Alexey Barsukov Kaustav Bose Bodhayan Roy

Published in: CoRR (2022)

Keyphrases

np complete
type fuzzy logic systems
randomly generated
satisfiability problem
interval data
learning algorithm
bayesian networks
np hard
directed graph
bipartite graph
graph representation
polynomial time complexity