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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.