• QUALEX

  • Referenced in 51 articles [sw04742]
  • trust region technique for the maximum weight clique problem A new simple generalization ... Motzkin-Straus theorem for the maximum weight clique problem is formulated and directly proved. Within ... benchmark graphs and various random maximum weight clique problem instances...
  • ils-mwis

  • Referenced in 8 articles [sw41470]
  • generalization of the classical maximum independent set problem. Two efficient neighborhood structures are proposed ... best heuristics for the maximum weight clique problem. The results also show that the hybrid...
  • gpuls-mwcp

  • Referenced in 5 articles [sw41468]
  • local search heuristic for the maximum weight clique problem on massive graphs. Given an undirected ... maximum weight clique problem (MWCP) consists in finding a clique with maximum total weight ... neighborhood structures for the problem. These neighborhoods are explored using an efficient procedure that...
  • SCCWalk

  • Referenced in 4 articles [sw32102]
  • algorithm and its improvements for maximum weight clique problem. The maximum weight clique problem (MWCP...
  • sgcp-via-cliques

  • Referenced in 2 articles [sw34590]
  • cliques: Solving the (Weighted) Selective Graph Colouring Problem via Maximum Cliques...
  • HEWN

  • Referenced in 3 articles [sw02189]
  • CLIQUE problem. A Hierarchical Edge-Weighted Network (HEWN) which is equivalent to the corresponding Maximum ... built and hence the size of maximal clique is found. It is proved that HEWN...
  • NuMVC

  • Referenced in 13 articles [sw08219]
  • Local search has proved successful for this problem. However, there are two main drawbacks ... weighting techniques to diversify the search, these algorithms lack mechanisms for decreasing the weights ... weighting with forgetting not only increases weights of uncovered edges, but also decreases some weights ... current best exact algorithm for Maximum Clique on random instances as well as some structured...
  • CoCoA

  • Referenced in 654 articles [sw00143]
  • CoCoA is a system for Computations in Commutative...
  • GAP

  • Referenced in 3189 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • LAPACK

  • Referenced in 1702 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • Macaulay2

  • Referenced in 1923 articles [sw00537]
  • Macaulay2 is a software system devoted to supporting...
  • Magma

  • Referenced in 3315 articles [sw00540]
  • Computer algebra system (CAS). Magma is a large...
  • Maple

  • Referenced in 5373 articles [sw00545]
  • The result of over 30 years of cutting...
  • MapReduce

  • Referenced in 263 articles [sw00546]
  • MapReduce is a new parallel programming model initially...
  • Mathematica

  • Referenced in 6355 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 13544 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • MiniSat

  • Referenced in 566 articles [sw00577]
  • An extensible SAT-solver. MiniSat is a minimalistic...
  • nauty

  • Referenced in 609 articles [sw00611]
  • graph-theoretic program NAUTY: nauty is a program...