Nikhil Shukla

Vertex coloring of graphs via phase dynamics of coupled oscillatory networks

2017 · Scientific Reports

Abstract While Boolean logic has been the backbone of digital information processing, there exist classes of computationally hard problems wherein this paradigm is fundamentally inefficient. Vertex coloring of graphs, belonging to the class of combinatorial …

Graph Coloring Using Coupled Oscillator-Based Dynamical Systems

2021

Graph coloring is a NP-hard problem, and computing the solution on a digital computer entails an exponential increase in the computing resources (time, memory) with increasing problem size. This has motivated the search for alternate …

Designing Ising machines with higher order spin interactions and their application in solving combinatorial optimization

2023 · Scientific Reports

The Ising model provides a natural mapping for many computationally hard combinatorial optimization problems (COPs). Consequently, dynamical system-inspired computing models and hardware platforms that minimize the Ising Hamiltonian, have recently been proposed as a potential …