Hardware Accelerator for Subgraph Isomorphism Problems

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Shuichi Ichikawa Articles by Lerdtanaseangtham Udorn Articles by Kouji Konishi

2000 IEEE Symposium on Field-Programmable Custom Computing Machines

Napa, California

April 17-April 19

ISBN: 0-7695-0871-5

	ASCII Text	x
	Shuichi Ichikawa, Lerdtanaseangtham Udorn, Kouji Konishi, "Hardware Accelerator for Subgraph Isomorphism Problems," Field-Programmable Custom Computing Machines, Annual IEEE Symposium on, pp. 283, 2000 IEEE Symposium on Field-Programmable Custom Computing Machines, 2000.

	BibTex	x
	@article{ 10.1109/FPGA.2000.903417, author = {Shuichi Ichikawa and Lerdtanaseangtham Udorn and Kouji Konishi}, title = {Hardware Accelerator for Subgraph Isomorphism Problems}, journal ={Field-Programmable Custom Computing Machines, Annual IEEE Symposium on}, volume = {0}, year = {2000}, issn = {1082-3409}, pages = {283}, doi = {http://doi.ieeecomputersociety.org/10.1109/FPGA.2000.903417}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Field-Programmable Custom Computing Machines, Annual IEEE Symposium on TI - Hardware Accelerator for Subgraph Isomorphism Problems SN - 1082-3409 SP EP A1 - Shuichi Ichikawa, A1 - Lerdtanaseangtham Udorn, A1 - Kouji Konishi, PY - 2000 VL - 0 JA - Field-Programmable Custom Computing Machines, Annual IEEE Symposium on ER -

Shuichi Ichikawa, Toyohashi University of Technology

Lerdtanaseangtham Udorn, Toyohashi University of Technology

Kouji Konishi, Toyohashi University of Technology

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FPGA.2000.903417

Many applications can be modeled as subgraph isomorphism problem, which is generally NP-complete. This paper presents an algorithm that is suited for hardware implementation. The prototype accelerator that operates at 16.5 MHz on Lucent ORCA 2C15A FPGA outperforms the software implementation of Ullmann's algorithm on 400 MHz Pentium II by 10 times in the best case.

Citation:

Shuichi Ichikawa, Lerdtanaseangtham Udorn, Kouji Konishi, "Hardware Accelerator for Subgraph Isomorphism Problems," fccm, pp.283, 2000 IEEE Symposium on Field-Programmable Custom Computing Machines, 2000

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.