• gRbase

  • Referenced in 13 articles [sw10198]
  • matrix). Some graph algorithms are: (i) maximum cardinality search (for marked and unmarked graphs...
  • TABARIS

  • Referenced in 16 articles [sw02534]
  • exact algorithm based on tabu search for finding a maximum independent set in a graph ... graph an independent set with maximum cardinality is presented. It consists of an implicit enumeration ... obtained by applying an adaptation of Tabu Search. Computational results are given which show that...
  • Algorithm 787

  • Referenced in 11 articles [sw13182]
  • problem is an independent set of maximum cardinality. This article describes gmis ... solution of a maximum independent set problem. A Greedy Randomized Adaptive Search Procedure (GRASP...
  • MixMoGenD

  • Referenced in 6 articles [sw08624]
  • competing models are compared using penalized maximum likelihood criteria. Under weak assumptions on the penalty ... www.math.u-psud.fr/ toussile. To avoid an exhaustive search of the optimum model, we propose a modified ... enables a better search of the optimum model among all possible cardinalities...
  • IncMaxCLQ

  • Referenced in 1 article [sw21468]
  • computing upper bounds for the cardinality of a maximum clique of a graph. However, existing ... drawbacks: (1) at every node of the search tree, MaxSAT reasoning has to be performed...
  • VISOR

  • Referenced in 1 article [sw02236]
  • independence system, based on a set of cardinality n having at most 2 n subsets ... solves the problems of finding all maximum independent and minimum dependent sets. Those problems ... visits to the oracle than an exhaustive search, while the time spent in visiting...
  • CCSP

  • Referenced in 14 articles [sw00111]
  • CCSP: A formal system for distributed program debugging...
  • Coq

  • Referenced in 1880 articles [sw00161]
  • Coq is a formal proof management system. It...
  • CSDP

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • GAP

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

  • Referenced in 279 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • Isabelle

  • Referenced in 698 articles [sw00454]
  • Isabelle is a generic proof assistant. It allows...
  • LEDA

  • Referenced in 263 articles [sw00509]
  • In the core computer science areas -- data structures...
  • Maple

  • Referenced in 5363 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

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

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

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

  • Referenced in 314 articles [sw00724]
  • polymake is open source software for research in...
  • QSHEP3D

  • Referenced in 71 articles [sw00762]
  • Algorithm 661 QSHEP3D: Quadratic Shepard method for trivariate...
  • R

  • Referenced in 9810 articles [sw00771]
  • R is a language and environment for statistical...