Login / Signup

Identification Conditions for the Solvability of NP-Complete Problems for the Class of Prefractal Graphs.

Alexander V. TymoshenkoRasul A. KochkarovAzret A. Kochkarov
Published in: Autom. Control. Comput. Sci. (2022)
Keyphrases
  • np complete problems
  • max cut
  • np complete
  • graph coloring
  • phase transition
  • neural network
  • sufficient conditions
  • planar graphs