A Comparison of Algorithms for the Maximum Clique Problem

Pierre Hansen; Nenad Mladenović

The Yugoslav Journal of Operations Research (1992)

  • Volume: 2, Issue: 3, page 3-11
  • ISSN: 0354-0243

How to cite

top

Pierre Hansen, and Nenad Mladenović. "A Comparison of Algorithms for the Maximum Clique Problem." The Yugoslav Journal of Operations Research 2.3 (1992): 3-11. <http://eudml.org/doc/261672>.

@article{PierreHansen1992,
author = {Pierre Hansen, Nenad Mladenović},
journal = {The Yugoslav Journal of Operations Research},
language = {eng},
number = {3},
pages = {3-11},
publisher = {Faculty of Organizational Sciences},
title = {A Comparison of Algorithms for the Maximum Clique Problem},
url = {http://eudml.org/doc/261672},
volume = {2},
year = {1992},
}

TY - JOUR
AU - Pierre Hansen
AU - Nenad Mladenović
TI - A Comparison of Algorithms for the Maximum Clique Problem
JO - The Yugoslav Journal of Operations Research
PY - 1992
PB - Faculty of Organizational Sciences
VL - 2
IS - 3
SP - 3
EP - 11
LA - eng
UR - http://eudml.org/doc/261672
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.