Login / Signup
On the complexity of some quorum colorings problems of graphs.
Rafik Sahbi
Published in:
AKCE Int. J. Graphs Comb. (2020)
Keyphrases
</>
decision problems
np complete
distributed databases
problems involving
np hardness
benchmark problems
polynomial hierarchy
polynomial time complexity
computational cost
scheduling problem
response time
simulated annealing
application domains
difficult problems