Vertex coloring of graphs via phase dynamics of coupled oscillatory networks.
Ontology highlight
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 optimization, represents one such problem. It is well studied for its applications in data sciences, life sciences, social sciences and technology, and hence, motivates alternate, more efficient non-Boolean pathways towards its solution. Here we demonstrate a coupled relaxation oscillator based dynamical system that exploits insulator-metal transition in Vanadium Dioxide (VO2) to efficiently solve vertex coloring of graphs. Pairwise coupled VO2 oscillator circuits have been analyzed before for basic computing operations, bu
SUBMITTER: Parihar A
PROVIDER: S-EPMC5430425 | biostudies-literature | 2017 Apr
REPOSITORIES: biostudies-literature
ACCESS DATA