A Novel Approach to Complex Problems
classification
❄️ cond-mat.dis-nn
cond-mat.softhep-th
keywords
graphproblemsapproachcomplexnovelapplicationsappliedbeen
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.