A Hardware Algorithm for the Minimum p-Quasi Clique Cover Problem

Shuichi Watanabe, Junji Kitamichi, Kenichi Kuroda. A Hardware Algorithm for the Minimum p-Quasi Clique Cover Problem. In Koen Bertels, Walid A. Najjar, Arjan J. van Genderen, Stamatis Vassiliadis, editors, FPL 2007, International Conference on Field Programmable Logic and Applications, Amsterdam, The Netherlands, 27-29 August 2007. pages 139-144, IEEE, 2007. [doi]

@inproceedings{WatanabeKK07,
  title = {A Hardware Algorithm for the Minimum p-Quasi Clique Cover Problem},
  author = {Shuichi Watanabe and Junji Kitamichi and Kenichi Kuroda},
  year = {2007},
  doi = {10.1109/FPL.2007.4380638},
  url = {http://dx.doi.org/10.1109/FPL.2007.4380638},
  researchr = {https://researchr.org/publication/WatanabeKK07},
  cites = {0},
  citedby = {0},
  pages = {139-144},
  booktitle = {FPL 2007, International Conference on Field Programmable Logic and Applications, Amsterdam, The Netherlands, 27-29 August 2007},
  editor = {Koen Bertels and Walid A. Najjar and Arjan J. van Genderen and Stamatis Vassiliadis},
  publisher = {IEEE},
  isbn = {1-4244-1060-6},
}