Fast Winner-Takes-All Networks for the Maximum Clique Problem

Brijnesh J. Jain, Fritz Wysotzki. Fast Winner-Takes-All Networks for the Maximum Clique Problem. In Matthias Jarke, Jana Koehler, Gerhard Lakemeyer, editors, KI 2002: Advances in Artificial Intelligence, 25th Annual German Conference on AI, KI 2002, Aachen, Germany, September 16-20, 2002, Proceedings. Volume 2479 of Lecture Notes in Computer Science, pages 163-173, Springer, 2002. [doi]

@inproceedings{JainW02,
  title = {Fast Winner-Takes-All Networks for the Maximum Clique Problem},
  author = {Brijnesh J. Jain and Fritz Wysotzki},
  year = {2002},
  url = {http://link.springer.de/link/service/series/0558/bibs/2479/24790163.htm},
  researchr = {https://researchr.org/publication/JainW02},
  cites = {0},
  citedby = {0},
  pages = {163-173},
  booktitle = {KI 2002: Advances in Artificial Intelligence, 25th Annual German Conference on AI, KI 2002, Aachen, Germany, September 16-20, 2002, Proceedings},
  editor = {Matthias Jarke and Jana Koehler and Gerhard Lakemeyer},
  volume = {2479},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-44185-9},
}