NP-complete variants of some classical graph problems.

Per Alexandersson

Published in: CoRR (2020)

Keyphrases

np complete
polynomial time complexity
np hard
randomly generated
random walk
constraint satisfaction problems
graph model
data sets
optimization problems
structured data
phase transition
satisfiability problem
bipartite graph