Answers are grounded in this paper and cite their sources.
A new theoretical approach to graph processing, based on the transformation of a topological graph into a time-dependent periodic melody, is proposed. By using a self-tuning oscillatory dynamical network, graphs can be uniquely reconstructed from their melodies. This opens a perspective for a content-addressable memory invariant under large topology-preserving distortions.
No takes yet. Share an insight, caveat, or question.
Alexander S. Mikhailov (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: