Login / Signup
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete.
Celina M. H. de Figueiredo
Alexsander Andrade de Melo
Fabiano de S. Oliveira
Ana 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