Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/sac/KatayamaHN04
%A Katayama, Kengo
%A Hamamoto, Akihiro
%A Narihisa, Hiroyuki
%B SAC
%D 2004
%E Haddad, Hisham
%E Omicini, Andrea
%E Wainwright, Roger L.
%E Liebrock, Lorie M.
%I ACM
%K dblp
%P 1021-1025
%T Solving the maximum clique problem by k-opt local search.
%U http://dblp.uni-trier.de/db/conf/sac/sac2004.html#KatayamaHN04
%@ 1-58113-812-1
@inproceedings{conf/sac/KatayamaHN04,
added-at = {2018-11-06T00:00:00.000+0100},
author = {Katayama, Kengo and Hamamoto, Akihiro and Narihisa, Hiroyuki},
biburl = {https://www.bibsonomy.org/bibtex/2e5ca395f25154e82e1170b390518217b/dblp},
booktitle = {SAC},
crossref = {conf/sac/2004},
editor = {Haddad, Hisham and Omicini, Andrea and Wainwright, Roger L. and Liebrock, Lorie M.},
ee = {https://doi.org/10.1145/967900.968107},
interhash = {e4b2453270055b0923caa32b509ab45c},
intrahash = {e5ca395f25154e82e1170b390518217b},
isbn = {1-58113-812-1},
keywords = {dblp},
pages = {1021-1025},
publisher = {ACM},
timestamp = {2018-11-07T13:16:07.000+0100},
title = {Solving the maximum clique problem by k-opt local search.},
url = {http://dblp.uni-trier.de/db/conf/sac/sac2004.html#KatayamaHN04},
year = 2004
}