A Fast Algorithm for the maximum clique problem

    Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

    Original languageEnglish
    Title of host publication30th South-Eastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, USA, 8.-12.3.1999
    Publication statusPublished - 1999
    MoE publication typeA4 Article in a conference publication

    Keywords

    • branch-and-bound algorithm
    • graph algorithm
    • maximum clique problem

    Cite this