%0 Conference Paper %1 conf/faw/TomitaYHNIW16 %A Tomita, Etsuji %A Yoshida, Kohei %A Hatta, Takuro %A Nagao, Atsuki %A Ito, Hiro %A Wakatsuki, Mitsuo %B FAW %D 2016 %E Zhu, Daming %E Bereg, Sergey %I Springer %K dblp %P 215-226 %T A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique. %U http://dblp.uni-trier.de/db/conf/faw/faw2016.html#TomitaYHNIW16 %V 9711 %@ 978-3-319-39817-4

@inproceedings{conf/faw/TomitaYHNIW16, added-at = {2022-10-02T00:00:00.000+0200}, author = {Tomita, Etsuji and Yoshida, Kohei and Hatta, Takuro and Nagao, Atsuki and Ito, Hiro and Wakatsuki, Mitsuo}, biburl = {https://www.bibsonomy.org/bibtex/2d09f6f35f689db2c7e266551c2e95f16/dblp}, booktitle = {FAW}, crossref = {conf/faw/2016}, editor = {Zhu, Daming and Bereg, Sergey}, ee = {https://doi.org/10.1007/978-3-319-39817-4_21}, interhash = {3149dbadf191861fd862671fd7578bbe}, intrahash = {d09f6f35f689db2c7e266551c2e95f16}, isbn = {978-3-319-39817-4}, keywords = {dblp}, pages = {215-226}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T13:39:50.000+0200}, title = {A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique.}, url = {http://dblp.uni-trier.de/db/conf/faw/faw2016.html#TomitaYHNIW16}, volume = 9711, year = 2016 }