• TABARIS

  • Referenced in 16 articles [sw02534]
  • tabu search for finding a maximum independent set in a graph. A technique for finding ... graph an independent set with maximum cardinality is presented. It consists of an implicit enumeration ... uses at various stages bounds on the independence number of a subgraph. These are obtained...
  • Algorithm 787

  • Referenced in 11 articles [sw13182]
  • Fortran subroutines for approximate solution of maximum independent set problems using GRASP ... graph, where V and E are the sets of vertices and edges of G, respectively ... solution to the NP-hard maximum independent set problem is an independent set of maximum ... find an approximate solution of a maximum independent set problem. A Greedy Randomized Adaptive Search...
  • BHOSLIB

  • Referenced in 16 articles [sw08220]
  • Solutions for Graph Problems (Maximum Clique, Maximum Independent Set, Minimum Vertex Cover and Vertex Coloring...
  • GreedyMAX

  • Referenced in 5 articles [sw02058]
  • GreedyMAX-type algorithms for the maximum independent set problem...
  • SubMAP

  • Referenced in 3 articles [sw25790]
  • able to reveal these functionally similar molecule sets across different species, we develop an algorithm ... reduction from the maximum weight independent set (MWIS) problem. We then convert our problem...
  • Hopcroft-Karp

  • Referenced in 1 article [sw29832]
  • bipartite max-cardinality matching and max independent set. Takes as input a bipartite graph ... lists format, and outputs both a maximum matching (largest possible ... nonadjacent edges) and a maximum independent set (largest possible set of nonadjacent vertices). The running...
  • Biq Mac

  • Referenced in 72 articles [sw10532]
  • maximum weight in a weighted graph. We use a Branch-and-Bound setting that applies ... instance of size up to $n = 100$, independent of the density. For some problems...
  • INDDGO

  • Referenced in 2 articles [sw23104]
  • INDDGO). The INDDGO software package offers a set of tools for finding exact solutions ... tree decompositions and solving the maximum weighted independent set problem. The parallel dynamic programming algorithm...
  • RIBRA

  • Referenced in 1 article [sw02607]
  • RIBRA applies nearest neighbor and weighted maximum independent set algorithms to solve the problem...
  • VISOR

  • Referenced in 1 article [sw02236]
  • independent or not. Because the algorithm generates all those sets, it solves ... problems of finding all maximum independent and minimum dependent sets. Those problems are known...
  • GraphCombEx

  • Referenced in 0 articles [sw32090]
  • supported include maximum clique, graph colouring, maximum independent set, minimum vertex clique covering, minimum dominating...
  • DRED

  • Referenced in 16 articles [sw02281]
  • connections. In addition, RED’s optimal parameter setting is largely correlated with the number ... router queue occupancy at a level independent of the number of active TCP connections ... network are high resources utilization, predictable maximum delays, more certain buffer provisioning, and traffic-load...
  • Quartets MaxCut

  • Referenced in 7 articles [sw29616]
  • reconstruction methods are currently limited to a maximum of few dozens of taxa. Supertree methods ... tree over a large set of taxa, from a set of small trees over overlapping ... subsets of the complete taxa set. Hence, in order to construct the tree of life ... algorithm for constructing a tree from a set of input quartet trees even with...
  • MAX-FISM

  • Referenced in 3 articles [sw27584]
  • inserted in the current window only its maximum itemset should be inserted into a prefix ... data structure called Max-Set for maintaining the number of independent appearance of each transaction...
  • RBVE

  • Referenced in 2 articles [sw27810]
  • failure pattern are not statistically independent. The failure and the censoring distributions are considered ... established, and the asymptotic normality of the maximum likelihood estimator of the parameters is proved ... asymptotic normality. A practical data set is considered for the purpose of fitting the model...
  • OXBench

  • Referenced in 7 articles [sw22988]
  • COFFEE method on a data set of families with <8 sequences gave 91.4% accuracy, significantly ... methods. The STAMP Sc Score which is independent of a reference alignment also gave good ... score matrices rather than algorithmic refinements. The maximum theoretical alignment accuracy obtained by pooling results...
  • SR_BR_LR.svb

  • Referenced in 1 article [sw37311]
  • independent variables. However, the application of logistic regression to small data sets is often hindered ... Under the separation scenario, results obtained via maximum likelihood should not be trusted, since...
  • GMCM

  • Referenced in 2 articles [sw24057]
  • clustering. Li, Brown, Huang, and Bickel (2011) independently discussed a special case of these GMCMs ... novel approach to meta-analysis in highdimensional settings. GMCMs have attractive properties which make them ... expectation-maximization-like algorithms as their pseudo maximum likelihood estimation procedure. We present and discuss...
  • Nefrit

  • Referenced in 2 articles [sw04094]
  • maximum extent, the system utilizes possibilities of fuzzy set theory, including applications of the theory ... from the assumption that evaluation criteria are independent; an overall fuzzy utility is calculated...
  • milr

  • Referenced in 0 articles [sw15884]
  • multiple instance data set consists of many independent subjects (called bags) and each subject ... called instances). The outcomes of such data set are binary or multinomial ... multiple instance data set with binary outcomes and performs the maximum likelihood estimation with...