• Cliquer

  • Referenced in 67 articles [sw05044]
  • Cliquer - routines for clique searching. Cliquer is a set of C routines for finding cliques...
  • QUALEX

  • Referenced in 49 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...
  • MaxCliqueDyn

  • Referenced in 34 articles [sw08507]
  • Maximum Clique Algorithm: MaxCliqueDyn is a fast exact algorithm for finding a maximum clique ... developed by Janez Konc. A clique is a fully connected subgraph of a graph ... maximum clique is the clique with the largest number of vertices in a given graph ... Maximum clique algorithms differ from maximal clique algorithms (e.g., Bron-Kerbosch algorithm). The maximal search...
  • clique

  • Referenced in 28 articles [sw07590]
  • underlying distributed multifrontal solver, clique...
  • CFinder

  • Referenced in 24 articles [sw12379]
  • CFinder: locating cliques and overlapping modules in biological networks. Summary: Most cellular tasks are performed ... also very efficient for locating the cliques of large sparse graphs. Availability: CFinder (for Windows...
  • CliqueTop

  • Referenced in 18 articles [sw29766]
  • syntax for using the package is: ompute_clique_topology(A) for any symmetric matrix ... found in the documentation for the compute_clique_topology function. CliqueTop currently relies ... change in the future. Cliquer, for the clique splitting version of the clique enumeration algorithm ... found in Giusti, Pastalkova, Curto and Itskov, ”Clique topology reveals instrinsic geometric structure in neural...
  • PSP

  • Referenced in 28 articles [sw07589]
  • underlying distributed multifrontal solver, clique...
  • Max-AO

  • Referenced in 22 articles [sw05032]
  • relaxations of maximum stable set and maximum clique problems,graph input...
  • BBMCL

  • Referenced in 12 articles [sw11525]
  • Relaxed approximate coloring in exact maximum clique search. This paper presents selective coloring ... paradigm for branch-and-bound exact maximum clique search. Approximate coloring has, in recent, years...
  • BHOSLIB

  • Referenced in 15 articles [sw08220]
  • Hidden Optimum Solutions for Graph Problems (Maximum Clique, Maximum Independent Set, Minimum Vertex Cover...
  • FASoft

  • Referenced in 15 articles [sw08508]
  • heuristics, sequential assignment algorithms, and a maximal clique algorithm to aid in the assignment process...
  • cliques

  • Referenced in 8 articles [sw23575]
  • Enumerating maximal cliques in link streams with durations. Link streams model interactions over time ... clique in a link stream is defined as a set of nodes and a time ... propose an algorithm to detect maximal cliques that improves our previous one for instantaneous link...
  • NuMVC

  • Referenced in 12 articles [sw08219]
  • current best exact algorithm for Maximum Clique on random instances as well as some structured...
  • CLIP

  • Referenced in 7 articles [sw14373]
  • CLIP: similarity searching of 3D databases using clique detection. This paper describes a program ... Identification Program), that uses the Bron-Kerbosch clique detection algorithm to find those structures ... regarded as equivalent during the clique-construction stage of the matching algorithm. Experiments with...
  • jHoles

  • Referenced in 6 articles [sw15020]
  • tool for understanding biological complex networks via clique weight rank persistent homology. Complex networks equipped ... efficient implementation of the filtering process for clique weight rank homology. We will give ... algorithm, its implementation and the problem of clique weight rank homology. We present a biological...
  • BBMCSP

  • Referenced in 6 articles [sw17718]
  • exact maximum clique algorithm for large and massive sparse graphs. This paper describes ... very efficient branch-and-bound exact maximum clique algorithm BBMCSP, designed for large and massive ... fields. State-of-the-art exact maximum clique algorithms encode the adjacency matrix in full...
  • Cluster-C

  • Referenced in 6 articles [sw10932]
  • sequences based on the extraction of maximal cliques Although the characterization of proteins cannot solely ... which is based on the detection of cliques, ensures a high level of connectivity within...
  • iSAM2

  • Referenced in 6 articles [sw34747]
  • conditional densities represented by its cliques. Based on that insight, we present a new method...
  • BBMCW

  • Referenced in 4 articles [sw21469]
  • enhanced bitstring encoding for exact maximum clique search in sparse graphs. This paper describes BBMCW ... efficient exact maximum clique algorithm tailored for large sparse graphs which can be bit-encoded...