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....
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2017
|
| Subjects: | |
| Online Access: | https://doaj.org/article/0399ad6e9bfc4366bea4e13fbf62a389 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!