Login / Signup

Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete.

Celina M. H. de FigueiredoAlexsander Andrade de MeloFabiano de S. OliveiraAna Silva
Published in: MFCS (2021)
Keyphrases
  • np complete
  • randomly generated
  • databases
  • neural network
  • database systems
  • interval data
  • polynomial time complexity
  • bayesian networks
  • satisfiability problem
  • graph theory
  • graph representation