• HEWN

  • Referenced in 3 articles [sw02189]
  • CLIQUE problem. A Hierarchical Edge-Weighted Network (HEWN) which is equivalent to the corresponding Maximum ... arrangement of vertices is hierarchical and each edge is attached by a guiding matrix that ... built and hence the size of maximal clique is found. It is proved that HEWN...
  • TSPLIB

  • Referenced in 698 articles [sw00983]
  • TSPLIB is a library of sample instances for...
  • ABACUS

  • Referenced in 116 articles [sw02948]
  • ABACUS is a software system written in C...
  • CPLEX

  • Referenced in 2773 articles [sw04082]
  • IBM® ILOG® CPLEX® offers C, C++, Java, .NET...
  • SNAP

  • Referenced in 171 articles [sw04184]
  • Stanford Network Analysis Platform (SNAP) is a general...
  • Knapsack

  • Referenced in 488 articles [sw04723]
  • Knapsack problems are the simplest NP-hard problems...
  • LEMON

  • Referenced in 48 articles [sw05043]
  • LEMON – an Open Source C++ Graph Template Library...
  • DIMACS

  • Referenced in 571 articles [sw08221]
  • The DIMACS Implementation Challenges address questions of determining...
  • BBMCL

  • Referenced in 17 articles [sw11525]
  • Relaxed approximate coloring in exact maximum clique search...
  • SplitsTree

  • Referenced in 32 articles [sw12234]
  • SplitsTree: A program for analyzing and visualizing evolutionary...
  • AS 136

  • Referenced in 339 articles [sw14176]
  • Algorithm AS 136: A K-Means Clustering Algorithm...
  • WebGraph

  • Referenced in 55 articles [sw30097]
  • WebGraph is a framework for graph compression aimed...