A Novel Approach to Complex Problems
arXiv:cond-mat/0209155
Abstract
A novel approach to complex problems has been previously applied to graph classification and the graph equivalence problem. Here we consider its applications to a wide set of NP complete problems, namely, those of finding a subgraph g inside a graph G.
9 pages