Vertex coloring of graphs via phase dynamics of coupled oscillatory networks
Abhinav Parihar, Nikhil Shukla, Matthew Jerry, Suman Datta, Arijit, Raychowdhury

TL;DR
This paper introduces a physics-inspired analog computing method using coupled oscillators and VO2 phase transitions to efficiently approximate solutions for the vertex coloring problem in graphs, a classically hard combinatorial optimization task.
Contribution
It presents a novel dynamical system leveraging VO2 insulator-metal transitions for graph coloring, connecting physical energy minimization with spectral algorithms.
Findings
Demonstrates efficient approximation of graph coloring using oscillator networks.
Establishes a link between dynamical system eigenproperties and spectral algorithms.
Proposes a physics-based approach for solving hard combinatorial problems.
Abstract
While Boolean logic has been the backbone of digital information processing, there are classes of computationally hard problems wherein this conventional paradigm is fundamentally inefficient. Vertex coloring of graphs, belonging to the class of combinatorial optimization represents such a problem; and is well studied for its wide spectrum of applications in data sciences, life sciences, social sciences and engineering and technology. This motivates alternate, and more efficient non-Boolean pathways to their solution. Here, we demonstrate a coupled relaxation oscillator based dynamical system that exploits the insulator-metal transition in vanadium dioxide (VO2), to efficiently solve the vertex coloring of graphs. By harnessing the natural analogue between optimization, pertinent to graph coloring solutions, and energy minimization processes in highly parallel, interconnected dynamical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
