arXiv · cond-mat/0209112
Graph equivalence and characterization via a continuous evolution of a physical analog
Abstract
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing problem in polynomial, short, time.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Vladimir Gudkov, Shmuel Nussinov. 2002-09-06. Graph equivalence and characterization via a continuous evolution of a physical analog. https://arxiv.org/abs/cond-mat/0209112
Cite the original work for its findings. Save a collection to share your selection of sources.