A novel VLSI solution to a difficult graph problem

Presents a VLSI solution of the independent set problem. This graph problem occurs in many applications including computer-aided design. The solution is based on a novel transformation of the graph to a logic circuit. The vertices in the graph are encoded with Boolean variables whose relationships a...

Full description

Saved in:
Bibliographic Details
Published in[1991] Proceedings. Fourth CSI/IEEE International Symposium on VLSI Design pp. 124 - 129
Main Authors Chakradhar, S.T., Agrawal, V.D.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1991
Subjects
Application software
Design automation
Encoding
Hardware
Logic circuits
Logic programming
National electric code
Neural networks
Signal processing algorithms
Very large scale integration
Online AccessGet full text

Cover

More Information
Summary:Presents a VLSI solution of the independent set problem. This graph problem occurs in many applications including computer-aided design. The solution is based on a novel transformation of the graph to a logic circuit. The vertices in the graph are encoded with Boolean variables whose relationships are represented in the logic circuit. The transformation is derived from the energy relation of the neural network model of the logic circuit. Each input vector provides one solution of the independent set problem. The independent set consists of only vertices with true encoding. This new methodology has the potential of solving the problem in real time if programmable logic is used.< >
ISBN:9780818621253
0818621257
DOI:10.1109/ISVD.1991.185104