ARTÍCULO
TITULO

Graph Coloring via Locally-Active Memristor Oscillatory Networks

Alon Ascoli    
Martin Weiher    
Melanie Herzig    
Stefan Slesazeck    
Thomas Mikolajick and Ronald Tetzlaff    

Resumen

This manuscript provides a comprehensive tutorial on the operating principles of a bio-inspired Cellular Nonlinear Network, leveraging the local activity of NbOx x memristors to apply a spike-based computing paradigm, which is expected to deliver such a separation between the steady-state phases of its capacitively-coupled oscillators, relative to a reference cell, as to unveal the classification of the nodes of the associated graphs into the least number of groups, according to the rules of a non-deterministic polynomial-hard combinatorial optimization problem, known as vertex coloring. Besides providing the theoretical foundations of the bio-inspired signal-processing paradigm, implemented by the proposed Memristor Oscillatory Network, and presenting pedagogical examples, illustrating how the phase dynamics of the memristive computing engine enables to solve the graph coloring problem, the paper further presents strategies to compensate for an imbalance in the number of couplings per oscillator, to counteract the intrinsic variability observed in the electrical behaviours of memristor samples from the same batch, and to prevent the impasse appearing when the array attains a steady-state corresponding to a local minimum of the optimization goal. The proposed Memristor Cellular Nonlinear Network, endowed with ad hoc circuitry for the implementation of these control strategies, is found to classify the vertices of a wide set of graphs in a number of color groups lower than the cardinality of the set of colors identified by traditional either software or hardware competitor systems. Given that, under nominal operating conditions, a biological system, such as the brain, is naturally capable to optimise energy consumption in problem-solving activities, the capability of locally-active memristor nanotechnologies to enable the circuit implementation of bio-inspired signal processing paradigms is expected to pave the way toward electronics with higher time and energy efficiency than state-of-the-art purely-CMOS hardware.

 Artículos similares

       
 
Max Bannach and Till Tantau    
Color coding is an algorithmic technique used in parameterized complexity theory to detect ?small? structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color pat... ver más
Revista: Algorithms

 
Derek H. Smith, Roberto Montemanni and Stephanie Perkins    
Let ??=(??,??) G = ( V , E ) be an undirected graph with vertex set V and edge set E. A clique C of G is a subset of the vertices of V with every pair of vertices of C adjacent. A maximum clique is a clique with the maximum number of vertices. A tabu se... ver más
Revista: Algorithms

 
Qinghai Li and Chang Wu Yu    
For many parallel and distributed systems, automatic data redistribution improves its locality and increases system performance for various computer problems and applications. In general, an array can be distributed to multiple processing systems by usin... ver más
Revista: Algorithms

 
Frank Gurski, Dominique Komander and Carolin Rehs    
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph ??=(??,... ver más
Revista: Algorithms

 
Muhammad Basit Shahab     Pág. 104 - 110
This paper proposes neural networks based graph coloring technique to assign Physical Cell Identities throughout the self-organized 3GPP Long Term Evolution Networks. PCIs are allocated such that no two cells in the vicinity of each other or with a commo... ver más