Field-Programmable Custom Computing Machines, Annual IEEE Symposium on (2000)
Apr. 17, 2000 to Apr. 19, 2000
Shuichi Ichikawa , Toyohashi University of Technology
Lerdtanaseangtham Udorn , Toyohashi University of Technology
Kouji Konishi , Toyohashi University of Technology
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.
K. Konishi, L. Udorn and S. Ichikawa, "Hardware Accelerator for Subgraph Isomorphism Problems," Field-Programmable Custom Computing Machines, Annual IEEE Symposium on(FCCM), Napa, California, 2000, pp. 283.