Graph equivalence and characterization via a continuous evolution of a physical analog

Loading...
Thumbnail Image

Date

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
RevTeX4

Citation

Collections

Endorsement

Review

Supplemented By

Referenced By