Vertex coloring of graphs via phase dynamics of coupled oscillatory networks
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....
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Nature Portfolio
2017
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/0399ad6e9bfc4366bea4e13fbf62a389 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|