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....
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN |
| Publicado: |
Nature Portfolio
2017
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/0399ad6e9bfc4366bea4e13fbf62a389 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|