Graph equivalence and characterization via a continuous evolution of a physical analog
<|reference_start|>Graph equivalence and characterization via a continuous evolution of a physical analog: 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.<|reference_end|>
@article{gudkov2002graph,
    title={Graph equivalence and characterization via a continuous evolution of a
  physical analog},
    author={Vladimir Gudkov and Shmuel Nussinov},
    journal={arXiv preprint arXiv:cond-mat/0209112},
    year={2002},
    archivePrefix={arXiv},
    eprint={cond-mat/0209112},
    primaryClass={cond-mat.stat-mech cs.DM hep-ph math.CO physics.comp-ph}
}