Ising formulations of some graph-theoretic problems in psychological research: models and methods
Ising formulations of some graph-theoretic problems in psychological research: models and methods
It is well known that many NP-hard and NP-complete graph-theoretic problems can be formulated and solved as Ising spin models. We discuss several problems that have a particular history in mathematical psychology, most notably max-cut clustering, graph coloring, a linear ordering problem related to paired comparison ranking and directed acyclic …