Approximately solving Maximum Clique using neural network and related heuristics.
A. Jagota, L. Sanchis, and R. Ganesan. Cliques, Coloring, and Satisfiability, volume 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 169-204. DIMACS/AMS, (1993)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/dimacs/JagotaSG93
%A Jagota, Arun
%A Sanchis, Laura A.
%A Ganesan, Ravikanth
%B Cliques, Coloring, and Satisfiability
%D 1993
%E Johnson, David S.
%E Trick, Michael A.
%I DIMACS/AMS
%K dblp
%P 169-204
%T Approximately solving Maximum Clique using neural network and related heuristics.
%U http://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html#JagotaSG93
%V 26
%@ 978-0-8218-6609-2
@inproceedings{conf/dimacs/JagotaSG93,
added-at = {2022-06-09T00:00:00.000+0200},
author = {Jagota, Arun and Sanchis, Laura A. and Ganesan, Ravikanth},
biburl = {https://www.bibsonomy.org/bibtex/2b467d9e7e5581d3bda20ee8c7a88788f/dblp},
booktitle = {Cliques, Coloring, and Satisfiability},
crossref = {conf/dimacs/dimacs26},
editor = {Johnson, David S. and Trick, Michael A.},
ee = {https://doi.org/10.1090/dimacs/026/10},
interhash = {be89779f85c06d8f0ed4c2b1e2b3f92c},
intrahash = {b467d9e7e5581d3bda20ee8c7a88788f},
isbn = {978-0-8218-6609-2},
keywords = {dblp},
pages = {169-204},
publisher = {DIMACS/AMS},
series = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
timestamp = {2024-04-09T17:58:34.000+0200},
title = {Approximately solving Maximum Clique using neural network and related heuristics.},
url = {http://dblp.uni-trier.de/db/conf/dimacs/dimacs26.html#JagotaSG93},
volume = 26,
year = 1993
}