Abstract
A new on-chip clique-finding VLSI processor is proposed for high-speed graph matching. Using VLSI arrays with the encoded information of all the vertices, the breadth-first search algorithm that finds corresponding vertices between two graphs can be performed in a digital-level pipelining manner. The effect of the digit-pipelined architecture is evaluated. >
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
