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: | Abhinav Parihar, Nikhil Shukla, Matthew Jerry, Suman Datta, Arijit Raychowdhury |
---|---|
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!
|
Ejemplares similares
-
Programmable coupled oscillators for synchronized locomotion
por: Sourav Dutta, et al.
Publicado: (2019) -
Clustering Vertex-Weighted Graphs by Spectral Methods
por: Juan-Luis García-Zapata, et al.
Publicado: (2021) -
Graphs of edge-to-vertex detour number 2
por: Santhakumaran,A. P.
Publicado: (2021) -
Odd vertex equitable even labeling of graphs
por: Jeyanthi,P, et al.
Publicado: (2017) -
Some new classes of vertex-mean graphs
por: Lourdusamy,A., et al.
Publicado: (2017)