Vertex coloring of graphs via phase dynamics of coupled oscillatory networks

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

Descripción completa

Detalles Bibliográficos
Autores principales: Parihar, Abhinav, Shukla, Nikhil, Jerry, Matthew, Datta, Suman, Raychowdhury, Arijit
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Nature Publishing Group UK 2017
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5430425/
https://www.ncbi.nlm.nih.gov/pubmed/28424457
http://dx.doi.org/10.1038/s41598-017-00825-1

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5430425/
https://www.ncbi.nlm.nih.gov/pubmed/28424457
http://dx.doi.org/10.1038/s41598-017-00825-1

Ejemplares similares