Učitavanje...

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

Cijeli opis

Spremljeno u:
Bibliografski detalji
Izdano u:Sci Rep
Glavni autori: Parihar, Abhinav, Shukla, Nikhil, Jerry, Matthew, Datta, Suman, Raychowdhury, Arijit
Format: Artigo
Jezik:Inglês
Izdano: Nature Publishing Group UK 2017
Teme:
Online pristup:https://ncbi.nlm.nih.gov/pmc/articles/PMC5430425/
https://ncbi.nlm.nih.gov/pubmed/28424457
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1038/s41598-017-00825-1
Oznake: Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!