20
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A review on algorithms for maximum clique problems

      ,
      European Journal of Operational Research
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references111

          • Record: found
          • Abstract: not found
          • Article: not found

          Graph clustering

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            New methods to color the vertices of a graph

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Clique is hard to approximate within n1−ε

                Bookmark

                Author and article information

                Journal
                European Journal of Operational Research
                European Journal of Operational Research
                Elsevier BV
                03772217
                May 2015
                May 2015
                : 242
                : 3
                : 693-709
                Article
                10.1016/j.ejor.2014.09.064
                a813e44f-1005-42f0-9f70-21f0ba2c7e4e
                © 2015
                History

                Comments

                Comment on this article