Tal Grossman. Applying the INN model to the Maximum Clique problem. In David S. Johnson, Michael A. Trick, editors, Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. Volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 125-146, DIMACS/AMS, 1993.
@inproceedings{Grossman93,
title = {Applying the INN model to the Maximum Clique problem},
author = {Tal Grossman},
year = {1993},
researchr = {https://researchr.org/publication/Grossman93},
cites = {0},
citedby = {0},
pages = {125-146},
booktitle = {Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993},
editor = {David S. Johnson and Michael A. Trick},
volume = {26},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
publisher = {DIMACS/AMS},
}